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.InputStreamReader;
import java.math.BigInteger;

public class VanyaAndLabel {
	
	public static String convert(char c)
	{
		switch(c)
		{
		case '0' :return Integer.toBinaryString(0);
		case '1' :return Integer.toBinaryString(1);
		case '2' :return Integer.toBinaryString(2);
		case '3' :return Integer.toBinaryString(3);
		case '4' :return Integer.toBinaryString(4);
		case '5' :return Integer.toBinaryString(5);
		case '6' :return Integer.toBinaryString(6);
		case '7' :return Integer.toBinaryString(7);
		case '8' :return Integer.toBinaryString(8);
		case '9' :return Integer.toBinaryString(9);
		case 'A' :return Integer.toBinaryString(10);
		case 'B' :return Integer.toBinaryString(11);
		case 'C' :return Integer.toBinaryString(12);
		case 'D' :return Integer.toBinaryString(13);
		case 'E' :return Integer.toBinaryString(14);
		case 'F' :return Integer.toBinaryString(15);
		case 'G' :return Integer.toBinaryString(16);
		case 'H' :return Integer.toBinaryString(17);
		case 'I' :return Integer.toBinaryString(18);
		case 'J' :return Integer.toBinaryString(19);
		case 'K' :return Integer.toBinaryString(20);
		case 'L' :return Integer.toBinaryString(21);
		case 'M' :return Integer.toBinaryString(22);
		case 'N' :return Integer.toBinaryString(23);
		case 'O' :return Integer.toBinaryString(24);
		case 'P' :return Integer.toBinaryString(25);
		case 'Q' :return Integer.toBinaryString(26);
		case 'R' :return Integer.toBinaryString(27);
		case 'S' :return Integer.toBinaryString(28);
		case 'T' :return Integer.toBinaryString(29);
		case 'U' :return Integer.toBinaryString(30);
		case 'V' :return Integer.toBinaryString(31);
		case 'W' :return Integer.toBinaryString(32);
		case 'X' :return Integer.toBinaryString(33);
		case 'Y' :return Integer.toBinaryString(34);
		case 'Z' :return Integer.toBinaryString(35);
		case 'a' :return Integer.toBinaryString(36);
		case 'b' :return Integer.toBinaryString(37);
		case 'c' :return Integer.toBinaryString(38);
		case 'd' :return Integer.toBinaryString(39);
		case 'e' :return Integer.toBinaryString(40);
		case 'f' :return Integer.toBinaryString(41);
		case 'g' :return Integer.toBinaryString(42);
		case 'h' :return Integer.toBinaryString(43);
		case 'i' :return Integer.toBinaryString(44);
		case 'j' :return Integer.toBinaryString(45);
		case 'k' :return Integer.toBinaryString(46);
		case 'l' :return Integer.toBinaryString(47);
		case 'm' :return Integer.toBinaryString(48);
		case 'n' :return Integer.toBinaryString(49);
		case 'o' :return Integer.toBinaryString(50);
		case 'p' :return Integer.toBinaryString(51);
		case 'q' :return Integer.toBinaryString(52);
		case 'r' :return Integer.toBinaryString(53);
		case 's' :return Integer.toBinaryString(54);
		case 't' :return Integer.toBinaryString(55);
		case 'u' :return Integer.toBinaryString(56);
		case 'v' :return Integer.toBinaryString(57);
		case 'w' :return Integer.toBinaryString(58);
		case 'x' :return Integer.toBinaryString(59);
		case 'y' :return Integer.toBinaryString(60);
		case 'z' :return Integer.toBinaryString(61);
		case '-' :return Integer.toBinaryString(62);
		case '_' :return Integer.toBinaryString(63);
		}
		return "";
	}
	
	static final BigInteger MOD = BigInteger.valueOf((long)1e9 + 7);
	
	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String s = bf.readLine();
		
		int n = 0;
		for(int i = 0; i < s.length(); i++)
		{
			String tmp = convert(s.charAt(i));
			n+=(6 - tmp.length());
			
			for(int j = 0; j < tmp.length(); j++)
				if(tmp.charAt(j)=='0') n++; 
		}		
		
		BigInteger three = BigInteger.valueOf(3);
		BigInteger ans = three.pow(n);
		ans = ans.mod(MOD);
		System.out.println(ans);
		
	}
}