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;

public class C {
    public static void main(String[] args) throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        String s=br.readLine();
        int count=0, num=0, ones;
        long sum=1;
        char ch;
        final long abs = 1000000007;
        for (int i = 0; i < s.length(); i++) {
            ones=0;
            ch=s.charAt(i);
            if (ch >='0' && ch<='9') num=(int) ch - (int) '0';
            if (ch>='A' && ch<='Z') num = (int) ch  - (int) 'A' + 10;
            if (ch>='a' && ch<='z') num = (int) ch - (int) 'a' + 36;
            if (ch=='-') num = 62;
            if (ch=='_') num=63;
            while (num > 0) {
                if (num % 2 == 1) ones++;
                num /= 2;
                }
            count += 6 - ones;
            }
        for (int i = 0; i < count; i++) {
            sum *= 3;
            if (sum > abs) sum = sum % abs;
        }
        System.out.println(sum);


        }

    }

