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
from collections import defaultdict

def convert(x):
    val = 0
    if x >= '0' and x <= "9":
        val = int(x)
    if x >= 'A' and x <= "Z":
        val = ord(x) - ord("A")
        val += 10
    if x >= 'a' and x <= "z":
        val = ord(x) - ord("a")
        val += 36
    if x == "-":
        val = 62
    if x == "_":
        val = 63
    return val

if __name__ == "__main__":
    S = input()
    words = []
    MOD = 10 ** 9 + 7
    cnt = defaultdict(int)
    for x in range(10):
        words.append(str(x))
    for x in range(ord("A"), ord("Z") + 1):
        words.append(chr(x))
    for x in range(ord("a"), ord("z") + 1):
        words.append(chr(x))
    words.append("-")
    words.append("_")
    for x in range(len(words)):
        for y in range(len(words)):
            if x == y:
                val = x & y
                cnt[val] += 1
            else:
                val = x & y
                cnt[val] += 1

    result = 1

    for x in S:
        val = convert(x)
        tmp = cnt[val]
        result *= tmp
        result %= MOD
    print (result % MOD)
