Unique String Generation

Given a string s, you can generate new strings by performing zero or more character replacement operations. For each character in s, you have two choices: keep it unchanged, or replace it with a distinct lexicographical alternative. Thus, the total number of unique strings that can be generated is 2^n, where n is the length of the string. Note that for an empty string, the result is defined to be 1.

Your task is to compute and output the number of unique strings that can be generated from the given input string.

Formula: \( \text{result} = 2^n \) where \( n = |s| \).

inputFormat

The input consists of a single string s. The string may contain alphabetical characters and can be empty. It is read from standard input (stdin).

outputFormat

Output a single integer representing the number of unique strings that can be generated by applying the described operations. The output should be written to standard output (stdout).

abc

8