Problem: 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

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class TasksSolution {
	
	public static InputOutputStream io = 
			new InputOutputStream(System.in, System.out);

	static int get(char c){
        if (c >= 'A' && c <= 'Z') {
            return 10 + c - 'A';
        } else if (c >= '0' && c <= '9') {
        	return c - '0';
        } else if (c >= 'a' && c <= 'z') {
        	return 36 + c - 'a';
        } else if (c == '-') {
        	return 62;
        } else {
        	return 63;
        }		
	}
	
	public static void main(String[] args) throws IOException {
		String S = io.next();
		int[] And = new int[64];
		Arrays.fill(And, 0);
		for(int i = 0; i < 64; i++){
			for(int j = 0; j < 64; j++){
				And[i & j]++;
			}
		}
		long ans = 1; 
		for(char c: S.toCharArray()){
			ans *= And[get(c)];
			ans %= (1000_000_000 + 7);
		}
		io.out.println(ans);
		io.close();
	}
	
	public static class InputOutputStream{
		public BufferedReader in = null;
		public PrintWriter out = null;
		public InputOutputStream(InputStream stdin, PrintStream stdout){
			this.in = new BufferedReader(new InputStreamReader(stdin));
			this.out = new PrintWriter(stdout, true);
		}
		public void close() throws IOException{
			this.in.close();
			this.out.close();
		}
		protected String InputLine = null;
		protected StringTokenizer IOTokenizer = null;
        public String next() {
            while (this.IOTokenizer == null || !this.IOTokenizer.hasMoreTokens()) {
                try {
                    this.IOTokenizer = new StringTokenizer(this.in.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return this.IOTokenizer.nextToken();
        }
	}

}