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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.Scanner;
import java.util.StringTokenizer;



public class A {


    static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
 
    public static int convertTo64(char ch){
        if(ch<='9' && ch>='0'){
            return ch-48;
        }
        else if(ch>='A' && ch<='Z'){
            return ch-'A'+10;
        }
        else if(ch>='a' && ch<='z'){
            return ch-'a'+36;
        }
        else if(ch=='-')
            return 62;
        else return 63;
    }

    public static long mod=1000000007;
    

    public static long pow(long a, int n ){
        long ret=1;
        while(n>0){
            if(n%2==1) ret=(ret * a)%mod;

            a=(a*a)%mod;
            n=n/2;
        }
        return ret;
    }

    public static int c;
    
	public static void main(String[] args) {
		FastReader scn=new FastReader();
		c=0;
        String dm=scn.nextLine();
       
        for (int i=0; i<dm.length();i++  ) {
            int n=convertTo64(dm.charAt(i));

            for (int k=5; k>=0; k--) {
                
                if((int) ((1<<k)&n) == 0 ){
                    c++;
                }
            }
        }
        //System.out.println(c);
        System.out.println(pow(3,c));

	}

}