Some children cannot pronounce all letters, while others sometimes pronounce letters correctly and sometimes do not. Kamil sometimes says T instead of K, but he never says K instead of T. Similarly, he sometimes says D instead of G. Furthermore, he sometimes says L instead of R, and at other times he says F. Of course, sometimes he happens to pronounce the letter correctly. Kamil's father always wonders how many actual words the word his son uttered could mean (he does not consider whether they are correct words in the Polish language).
Task
Write a program that:
- reads what Kamil said from standard input,
- calculates how many different words this could mean,
- prints the result to standard output.
Input
The first and only line of input contains a non-empty word spoken by Kamil. For simplicity, we assume that the word is written using only uppercase English letters and its length is at most 20.
Output
Your program should print (to standard output) only one line containing a single integer equal to the number of different words that the word spoken by Kamil could mean.
Examples
Input 1
FILIPEK
Output 1
4