You are given a string, , consisting of lowercase English letters.
A string is beautiful with respect to if it can be derived from by removing exactly characters.
Find and print the number of different strings that are beautiful with respect to .
A single string of lowercase English letters denoting .
Print the number of different strings that are beautiful with respect to .
The following strings can be derived by removing characters from : .
This gives us our set of unique beautiful strings, . As , we print .