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.File;
import java.io.PrintStream;
import java.util.Scanner;


public class A {
    
    static PrintStream cout = new PrintStream(System.out);
    static long modo = 1000000007;
    static Scanner cin;
    
    long f(char x){
        int ret = 1;
        int num = 0;
        
        if(x >= '0' && x <= '9') num = x - '0';
        else if(x >= 'A' && x <= 'Z') num = (x - 'A') + 10;
        else if(x >= 'a' && x <= 'z') num = (x - 'a') + 36;
        else if(x == '-') num = 62;
        else num = 63;
        
        for(int i = 0; i < 6; i++){
            if(((1 << i) & num) == 0) ret *= 3;
        }
        
        return ret;
    }
    
    void solve(){
        long ans = 1;
        String x = cin.next();
        for(int i = 0; i < x.length(); i++){
            ans *= f(x.charAt(i));
            ans %= modo;
        }
        cout.print(ans);
    }

    void run(String[] args) throws Exception {

        boolean is_local = args.length > 0 && args[0].equals("MASHREGHI");
        if (is_local) {//this is local host
            File inputFile = new File(System.getProperty("user.dir")
                    + "\\src\\in.in");
            cin = new Scanner(inputFile);
            cout.print(System.getProperty("user.dir") + "\\src\\"
                    + this.getClass().getName() + ".java\n"); //this is to be used when submitting code
        } else {
            cin = new Scanner(System.in);
        }

        solve();

        if (is_local) {
            cout.println();
        }
    }

    public static void main(String[] args) throws Exception {
        new A().run(args);
    }

}
