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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.math.BigInteger;
import java.util.*;

public class R355_3 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String s   = sc.nextLine();
/*
        System.out.println((int)'A');
        System.out.println((int)'Z');
        System.out.println((int)'a');
        System.out.println((int)'z');
        System.out.println((int)'_');
        System.out.println((int)'-');
        System.out.println((int)'0');
        System.out.println((int)'9');
        System.out.println((int)('9'-'0'));
*/
        String temp;
        long two = 0;
        for (int i = 0; i < s.length(); i++){
            char c = s.charAt(i);

            if (c <= '9' && c >= '0')
            {
                temp = Integer.toString((int)(c - '0'), 2);
                if (temp.length() < 6)
                {
                    temp = new String(new char[6-temp.length()]).replace("\0", "0") + temp;
                }
                for (int j = 0; j < temp.length(); j++)
                {
                    if (temp.charAt(j) == '0')
                    {
                        two += 1;
                    }
                }
            }
            if (c == '-')
            {
                two += 1;
            }
            if(c == '_');
            if(c <= 'z' && c >= 'a')
            {
                temp = Integer.toString((int)(c - 'a') + 36, 2);
                if (temp.length() < 6)
                {
                    temp = new String(new char[6-temp.length()]).replace("\0", "0") + temp;
                }
                //System.out.println(temp);
                for (int j = 0; j < temp.length(); j++)
                {
                    if (temp.charAt(j) == '0')
                    {
                        two += 1;
                    }
                }
            }
            if(c <= 'Z' && c >= 'A')
            {
                temp = Integer.toString((int)(c - 'A') + 10, 2);
                if (temp.length() < 6)
                {
                    temp = new String(new char[6-temp.length()]).replace("\0", "0") + temp;
                }
                //System.out.println(temp);
                for (int j = 0; j < temp.length(); j++)
                {
                    if (temp.charAt(j) == '0')
                    {
                        two += 1;
                    }
                }
            }

        }
        //System.out.println(two);
        BigInteger base = BigInteger.valueOf(3);
        BigInteger tempB = BigInteger.valueOf(two);
        BigInteger mod = BigInteger.valueOf(1000000007);
        System.out.println(base.modPow(tempB,mod));
    }


}