Unique Strings Generation

You are given a string s consisting of lowercase alphabetical characters along with the character ?. Each occurrence of ? can be replaced with any lowercase letter ('a' to 'z'). Your task is to determine the total number of unique strings that can be formed after replacing all occurrences of ? with a lowercase letter.

The answer is computed using the formula:

\(26^n\)

where \(n\) is the number of question marks in the string.

Note: The input is provided through standard input (stdin) as a single line string and you should print the answer to the standard output (stdout).

inputFormat

The input contains a single line with a non-negative string s, which may include lowercase letters and the character ?.

outputFormat

Output a single number representing the total number of unique strings that can be generated.

a?c

26