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
// https://community.topcoder.com/tc?module=ProblemDetail&rd=4472&pm=1524
// It is a bipartite verifications problem 
// We verify bipartiteness using DFS by assigning alternating colors to adj vertices making sure they dont 
// conflict with other neighbours


import java.io.*;
import java.util.*;
 
 
public class Main {
 
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		InputStream input = System.in;
		InputReader in = new InputReader(input);
		
   long dp[] = new long[1<<6];
   
   for(int i=0;i<(1<<6);i++)
   {
	   for(int j=0;j<(1<<6);j++)
		
			   dp[i&j]++;
	   
	 
	   
	   
	   
   }
 int mod = 1000000007;
	
	String   s = in.next();
	long ans = 1;
	for(int i=0;i<s.length();i++)
	{ char c = s.charAt(i);
		if(c>='0' && c<='9')
             
		ans =(long) (ans*dp[0+ (c-'0')])%mod;
		else if(c>='a' && c<='z')
        ans = (long) (ans*dp[36+(c-'a')])%mod;
		else if(c>='A'&&c<='Z')
			ans = (long) (ans*dp[10+(c-'A')])%mod;
		else if(c=='-')
			ans =(long)  (ans*dp[62])%mod;
		else ans = (long) (ans * dp[63])%mod;
        		
		//System.out.println(ans);
	}
			//System.out.println(dp[61]);
		System.out.println(ans);		
			
			
	}		
		
				
    static class Node{
    	
    	int x,y;
    	Node(int x,int y )
    	{
    		this.x=x;this.y=y;
    	}
    	
    }
    
		
	
	
	
	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
 
    }
} 
