While walking down the street Vanya saw a label "Hide&Seek". Because he is a programmer, he used & as a bitwise AND for these two words represented as a integers in base 64 and got new word. Now Vanya thinks of some string s and wants to know the number of pairs of words of length |s| (length of s), such that their bitwise AND is equal to s. As this number can be large, output it modulo 109 + 7.

To represent the string as a number in numeral system with base 64 Vanya uses the following rules:

  * digits from '0' to '9' correspond to integers from 0 to 9; 
  * letters from 'A' to 'Z' correspond to integers from 10 to 35; 
  * letters from 'a' to 'z' correspond to integers from 36 to 61; 
  * letter '-' correspond to integer 62; 
  * letter '_' correspond to integer 63. 

Input

The only line of the input contains a single word s (1 ≤ |s| ≤ 100 000), consisting of digits, lowercase and uppercase English letters, characters '-' and '_'.

Output

Print a single integer — the number of possible pairs of words, such that their bitwise AND is equal to string s modulo 109 + 7.

Examples

Input

z


Output

3


Input

V_V


Output

9


Input

Codeforces


Output

130653412

Note

For a detailed definition of bitwise AND we recommend to take a look in the corresponding article in Wikipedia.

In the first sample, there are 3 possible solutions: 

  1. z&_ = 61&63 = 61 = z
  2. _&z = 63&61 = 61 = z
  3. z&z = 61&61 = 61 = z
import java.io.*;
import java.util.*;

public class Problem3 {
	private static int decode(char a) {
		if (a >= '0' && a <= '9') {
			return a - '0';
		} else if (a >= 'A' && a <= 'Z') {
			return 10 + a - 'A';
		} else if (a >= 'a' && a <= 'z') {
			return 36 + a - 'a';
		} else if (a == '-') {
			return 62;
		} else {
			return 63;
		}
	}

	public static void main(String[] args) throws IOException {
		// long start = System.currentTimeMillis();

        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));

		String word = input.readLine();
		int length = word.length();
		long combinations = 1;

        for (int i = 0; i < length; i++) {
			int n = decode(word.charAt(i));
			int zeros = 6 - Integer.bitCount(n);
			combinations *= (long)Math.pow(3, zeros);
			combinations %= 1000000007;

        }

		System.out.println(combinations);

		// long time = System.currentTimeMillis() - start;
		// System.out.printf("Elapsed time: %dm, %ds, %dms.%n", time / 60000, (time / 1000) % 60, time % 1000);

	}
}
