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.util.Scanner;
import java.io.BufferedReader;
import java.io.PrintWriter;
import java.io.InputStreamReader;

public class _677C {
    final static long MOD=1000000007L;
    static int count(String b){
        int ans=0;
        for(int i=0;i<b.length();i++)
            if(b.charAt(i)=='0')ans++;
        ans+=(6-b.length());
        return ans;
    }
    static long pow_mod(long b,int e){
        long ans=1;
        while(e>0){
            if((e&1)==1)
                ans=(ans*b)%MOD;
            b=(b*b)%MOD;
            e>>=1;
        }
        return ans;
    }
    public static void main(String[] args) {
        Scanner sc=new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        PrintWriter pw=new PrintWriter(System.out);
        int cnt[]=new int[64];
        for(int i=0;i<64;i++)
            cnt[i]=count(Integer.toBinaryString(i));
        String s=sc.next();
        int n=s.length(),pos=0,c=0;
        long ans;
        for(int i=0;i<n;i++){
            char ch=s.charAt(i);
            if(ch=='_')pos=63;
            else if(ch=='-')pos=62;
            else if(ch>='a' && ch<='z')pos=ch-'a'+36;
            else if(ch>='A' && ch<='Z')pos=ch-'A'+10;
            else pos=ch-'0';
            c+=cnt[pos];
        }
        ans=pow_mod(3L,c);
        pw.println(ans);
        pw.flush();
    }
}