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;





public class Main {

	
	
	public static int getnum(char c){
		
		if(c>='0'&&c<='9')
			return c-'0';
		if(c>='A'&&c<='Z')
			return (int)(c-'A')+10;
		if(c>='a'&&c<='z')
			return (int)(c-'a')+36;
		if(c=='-')
			return 62;
		else 
			return 63;
		
		
		
	}
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out=new PrintWriter(System.out);
		
		String r=br.readLine();
		
		
		int max=1000000007;
		int zer=0;
	for (int i = 0; i < r.length(); i++) {
		int x=getnum(r.charAt(i));
	
		int ones=Integer.bitCount(x);
		
		 zer+=6-ones;
		
		
		
		
	}
	long count=1;
	
	for (int i = 0; i < zer; i++) {
		count*=3;
		count%=max;
	}
	
	
		 
		out.println(count);
		
		out.flush();
		

	}
}				