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

public class VanyaAndLabel {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		//PrintWriter out = new PrintWriter(new File("out.txt"));
		String s = bf.readLine();
		long res = 1L;
		long mod = 1000000007L;
		int n = s.length();
		long pre[] = new long[64];
		pre[0] = 729;
		pre[1] = 243;
		pre[2] = 243;
		pre[3] = 81;
		pre[4] = 243;
		pre[5] = 81;
		pre[6] = 81;
		pre[7] = 27;
		pre[8] = 243;
		pre[9] = 81;
		pre[10] = 81;
		pre[11] = 27;
		pre[12] = 81;
		pre[13] = 27;
		pre[14] = 27;
		pre[15] = 9;
		pre[16] = 243;
		pre[17] = 81;
		pre[18] = 81;
		pre[19] = 27;
		pre[20] = 81;
		pre[21] = 27;
		pre[22] = 27;
		pre[23] = 9;
		pre[24] = 81;
		pre[25] = 27;
		pre[26] = 27;
		pre[27] = 9;
		pre[28] = 27;
		pre[29] = 9;
		pre[30] = 9;
		pre[31] = 3;
		pre[32] = 243;
		pre[33] = 81;
		pre[34] = 81;
		pre[35] = 27;
		pre[36] = 81;
		pre[37] = 27;
		pre[38] = 27;
		pre[39] = 9;
		pre[40] = 81;
		pre[41] = 27;
		pre[42] = 27;
		pre[43] = 9;
		pre[44] = 27;
		pre[45] = 9;
		pre[46] = 9;
		pre[47] = 3;
		pre[48] = 81;
		pre[49] = 27;
		pre[50] = 27;
		pre[51] = 9;
		pre[52] = 27;
		pre[53] = 9;
		pre[54] = 9;
		pre[55] = 3;
		pre[56] = 27;
		pre[57] = 9;
		pre[58] = 9;
		pre[59] = 3;
		pre[60] = 9;
		pre[61] = 3;
		pre[62] = 3;
		pre[63] = 1;
		/*for (int i = 0 ; i < 64; i++) {
			long cnt = 0L;
			for (int j = 0; j < 64; j++)
				for (int k = 0; k < 64; k++)
					if ((k & j) == i)
						cnt++;
			out.println("pre[" + i + "] = " + cnt + ";");
		}
		out.flush();
		out.close();*/
		for (int i = 0; i < n; ++i) {
			int x = 0;
			char c = s.charAt(i);
			if (c >= '0' && c <= '9')
				x = c - '0';
			else if (c >= 'A' && c <= 'Z')
				x = c - 'A' + 10;
			else if (c >= 'a' && c <= 'z')
				x = c - 'a' + 36;
			else if (c == '-')
				x = 62;
			else
				x = 63;
			res = (res * (long) pre[x]) % mod;
		}
		System.out.println(res);
	}
}
