Problem: 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

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class Main {
    public static final long mod7 = 1000000007L;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        long t = 0;
        int[] lib = new int[] { 1, 2, 4, 8, 16, 32, 64 };
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            int a = toDec(c);
            t += countZero(a);
            // System.out.println(c + ": " + a + " - " + countZero(a) + " - " + t);
        }
        // System.out.println(t);
        long res = power(3, t, mod7);
        System.out.println(res);
    }

    public static int toDec(char s) {
        if (s == '_') {
            return 63;
        }
        if (s == '-') {
            return 62;
        }
        if ('0' <= s && s <= '9') {
            return Integer.valueOf(s + "");
        }
        if ('a' <= s && s <= 'z') {
            return ((int) s) - 97 + 36;
        }
        return ((int) s) - 65 + 10;
    }

    public static int countZero(int n) {
        int t = 0;
        // System.out.println();
        for (int i = 0; i < 6; i++) {
            // System.out.print((n >> i) & 1);
            t += ((n >> i) & 1);
        }
        // System.out.println();
        return 6 - t;
    }

    public static long power(long n, long k, long mod) {
        if (k == 0) {
            return 1;
        } else if (k % 2 == 0) {
            long t = power(n, k / 2, mod);
            return ((t % mod) * (t % mod)) % mod;
        }
        return n * power(n, k - 1, mod) % mod;
    }
}