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.*;
public class cf
{
    long MOD=1000000007;
    int dp[]=new int[65];
    int get(int ind)
    {
        int ret=0;
        for(int i=0; i<=63; i++)
        {
            for(int j=0; j<=63; j++)
            if((i&j)==ind)ret++;
        }
        return ret;
    }
    public void solve()throws IOException{
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String S=br.readLine();
        int l=S.length();
        for(int i=0; i<=63; i++)dp[i]=get(i);
        long ans=1;
        for(int i=0; i<l; i++)
        {
            int val=-1;
            char x=S.charAt(i);
            if(x=='-')val=62;
            else if(x=='_')val=63;
            else if(x>='0' && x<='9')val=x-'0';
            else if(x>='A' && x<='Z')val=x-'A'+10;
            else if(x>='a' && x<='z')val=x-'a'+36;
            ans=(ans*dp[val])%MOD;
        }
        System.out.println(ans);
    }
    public static void main(String []args)throws IOException
    {
        cf lol=new cf();
        lol.solve();
    }
}