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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class C {

	public static void main(String[] args) {

		MyScanner in = new MyScanner();

		int[] pairs = new int[64];
		for (int i = 0; i < 64; ++i) {
			for (int j = 0; j < 64; ++j) {
				pairs[(i&j)]++;				
			}
		}
		StringBuilder a = new StringBuilder();
		for(int i=0;i<=9;++i){
			a.append(i);
		}
		
		for(char i='A';i<='Z';++i){
			a.append(i);
		}
		
		for(char i='a';i<='z';++i){
			a.append(i);
		}
		a.append('-');
		a.append('_');
		String base = a.toString();
		
		String s = in.next();
		long result = 1l;
		long mod = 1000000007;
		for(int i=0;i<s.length();++i){
			int j = base.indexOf(s.charAt(i));
			result*=pairs[j];
			result%=mod;
		}
		
		System.out.println(result);
		
//		for(int i=0;i<64;++i){
//			System.out.println(i+"->"+pairs[i]);
//		}

	}

	// -----------PrintWriter for faster output---------------------------------
	public static PrintWriter out = new PrintWriter(System.out);

	// -----------MyScanner class for faster input----------
	public static class MyScanner {
		BufferedReader br;
		StringTokenizer st;

		public MyScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}

	}
	// --------------------------------------------------------

}
