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.PrintWriter;
import java.util.StringTokenizer;

public class Main {
	static long M = 1000000007;
	public static void main(String[] args) throws NumberFormatException, IOException {
		long[] ways = new long[64];
		for (int i = 0; i < ways.length; i++) {
			for (int j = 0; j < ways.length; j++) {
				for (int j2 = 0; j2 < ways.length; j2++) {
					if((j&j2)==i){
						ways[i]++;
					}
				}
			}
		}
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		char[] arr = new StringBuffer(in.next()).reverse().toString().toCharArray();
		long ans = 1;
		for (int i = 0; i < arr.length; i++) {
			int temp = arr[i] - '0';
			if(arr[i]>='A' && arr[i]<='Z')temp = arr[i] - 'A' + 10;
			if(arr[i]>='a' && arr[i]<='z')temp = arr[i] - 'a' + 36;
			if(arr[i]=='-')temp = 62;
			if(arr[i]=='_')temp = 63;
			ans *= ways[temp];
			ans%= M;
		}
		out.println(ans);
		out.close();
	}

	BufferedReader br;
	StringTokenizer st;

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
			st = new StringTokenizer("");
		}

		public String next() throws IOException {
			while (!st.hasMoreElements())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}
	}

}