Counting Valid Sentences

You are given a string consisting of uppercase letters and the special character '*'. The character '*' can be replaced by any uppercase letter from 'A' to 'Z'. Your task is to determine the number of distinct valid sentences that can be generated by performing all possible replacements.

Formally, if the input string contains k occurrences of '*', then the total number of valid sentences is given by:

$$26^{k}$$

For example, if the input string is "A*B", then the answer is 26, because there is only one '*' which can be replaced in 26 different ways.

inputFormat

The input consists of a single line containing a string s composed of uppercase letters and possibly the character '*'.

Note: The input will be read from stdin.

outputFormat

Output a single integer which is the total number of valid sentences that can be constructed by replacing every '*' with any uppercase letter from 'A' to 'Z'.

Note: The output should be written to stdout.

ABC

1