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.InputStream;
import java.io.InputStreamReader;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class CTask {

    public static void main(String[] args) {
        MyInputReader in = new MyInputReader(System.in);
        char[] s = in.next().toCharArray();
        int[] zeros = new int[64];
        for (int i = 0; i < 64; i++) {
            char[] a = Integer.toBinaryString(i).toCharArray();
            for (int j = 0; j < a.length; j++) {
                if (a[j] == '0') {
                    zeros[i] += 1;
                }
            }
            for (int j = a.length; j < 6; j++) {
                zeros[i] += 1;
            }
        }
        int zz = 0;
        long res = 1;
        for (int i = 0; i < s.length; i++) {
            int cur = asInt(s[i]);
            zz += zeros[cur];
        }
        for (int i = 0; i < zz; i++) {
            res *= 3;
            res %= 1000000007;
        }
        System.out.println(res);
    }

    static int asInt(char c) {
        int ic = (int) (c);
        if (c == '-') return 62;
        if (c == '_') return 63;
        if (c >= 'a' && ic <= 'z') return (c - 'a' + 36);
        if (c >= 'A' && ic <= 'Z') return (c - 'A' + 10);
        if (c >= '0' && ic <= '9') return (c - '0');
        return 0;
    }

    static class MyInputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public MyInputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }


    }

}
