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


public class C_VanyaAndLabel {
	public static void main(String args[])throws IOException{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer(br.readLine());
		String s=st.nextToken();
		int n=s.length();
		char sArr[]=s.toCharArray();
		String[] arr=new String[n];
		int x=0;
		for(int i=0;i<n;i++){
			if(sArr[i]-97>=0){
				x=sArr[i]-97+36;
			}
			else if(sArr[i]-95==0){
				x=63;
			}
			else if(sArr[i]-45==0){
				x=62;
			}
			else if(sArr[i]>=48&&sArr[i]<=57){
				x=sArr[i]-48;
			}
			else{
				x=sArr[i]-65+10;
			}
			arr[i]=Integer.toBinaryString(x);
		}
		
		long cnt0=0;
		
		for(int i=0;i<n;i++){
		//	System.out.println(arr[i]);
			int len=arr[i].length();
			cnt0=cnt0+(6-len);
			for(int j=0;j<len;j++){
				if((arr[i].charAt(j)-48)==0){
					cnt0++;
				}
			}
			
		}
		long mod=(long) (Math.pow(10,9)+7);
		//long ans=(long) Math.pow(3,cnt0);
		//System.out.println(ans-Math.pow(3,cnt0));
		long ans=1;
		for(int i=1;i<=cnt0;i++){
			ans=(ans*3)%mod;
		}
		
		System.out.println(ans%mod);
	}
}