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

/**
 * @author egaeus
 * @mail sebegaeusprogram@gmail.com
 * @veredict Accepted
 * @url <https://codeforces.com/problemset/problem/677/C>
 * @category bitwise
 * @date 14/06/2020
 **/

import java.io.*;
import java.util.*;

import static java.lang.Integer.*;
import static java.lang.Math.*;

public class CF677C {
    public static void main(String args[]) throws Throwable {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int[] q = new int[7];
        q[0] = 1;
        for (int i = 1; i < q.length; i++) {
            for (int k = 0; k < (1 << i); k++)
                for (int j = 0; j < (1 << i); j++)
                    if ((k & j) == 0)
                        q[i]++;
        }
        for (String ln; (ln = in.readLine()) != null && !ln.equals(""); ) {
            char[] s = ln.toCharArray();
            int N, a[] = new int[N = s.length];
            for (int i = 0; i < N; i++)
                if (Character.isDigit(s[i]))
                    a[i] = s[i] - '0';
                else if (s[i] == '-')
                    a[i] = 62;
                else if (s[i] == '_')
                    a[i] = 63;
                else if (Character.isLowerCase(s[i]))
                    a[i] = 36 + s[i] - 'a';
                else a[i] = 10 + s[i] - 'A';
            long multiplication = 1;
            for (int i = 0; i < N; i++) {
                multiplication = (q[(6 - bitCount(a[i]))] * multiplication) % 1000000007;
            }
            System.out.println(multiplication);
        }
    }
}
