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.*;
import java.util.*;

public class C {
    
    public static String getRep(int i){
        String rep = Integer.toBinaryString(i);
        StringBuilder t  =new StringBuilder();
        int more = 6-rep.length();
        while(more>0){
            t.append("0");
            more--;
        }
        rep = t.toString()+rep;
        rep = rep.substring(rep.length()-6);
//        IO.println("for i = "+i+" rep = "+rep);
        return rep;
    }
    
    public static void main(String[] args)throws Exception{
        IO.init(System.in);
        
        HashMap<Character, String> reg = new HashMap<>();
        char a = '0';
        for(int i=0;i<=9;++i){
            reg.put(a++, getRep(i));
        }
        a='A';
        for(int i=10;i<=35;++i){
            reg.put(a++, getRep(i));
        }
        a='a';
        for(int i=36;i<=61;++i){
            reg.put(a++, getRep(i));
        }
        reg.put('-', getRep(62));
        reg.put('_', getRep(63));
        
        String input = IO.next();
        long ans=1;
        for(int i=0;i<input.length();++i){
            char c = input.charAt(i);
            String rep = reg.get(c);
//            IO.println("for c = "+c+" rep = "+rep);
            for(int q=0;q<rep.length();++q){
                if(rep.charAt(q)=='0'){
                    ans = ans*3;
//                    IO.println("ans = "+ans);
                    ans = ans%((long)1e9+7);
                }
            }
        }
        IO.println(ans);
        
    }

    static class IO {
        static BufferedReader reader;
        static StringTokenizer tokenizer;
 
        static void init(InputStream input) {
            reader = new BufferedReader(new InputStreamReader(input) );
            tokenizer = new StringTokenizer("");
        }
 
        static String next() throws IOException {
            while ( ! tokenizer.hasMoreTokens() ) { 
                tokenizer = new StringTokenizer(reader.readLine() );
            }
            return tokenizer.nextToken();
        }

        static int nextInt() throws IOException {
            return Integer.parseInt( next() );
        }

        static double nextDouble() throws IOException {
            return Double.parseDouble( next() );
        }

        static void print(Object ... o){
            for(int i=0;i<o.length;++i){
                System.out.print(o[i]);
            }
        }

        static void println(Object ... o){
            for(int i=0;i<o.length;++i){
                System.out.print(o[i]);
            }
            System.out.println();
        }
    }
}

