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 sys

def pow3mod(expn, mod):
    lst = [1]
    while len(lst) <= expn:
        lst.append(3* lst[-1] % mod)
    return lst[expn]

def cntbinaryones(num):
    return len([x for x in bin(num)[2:] if x == '1'])

def lettertonum(char):
    if char.isdigit():
        return int(char)
    if char.isupper():
        return ord(char) - ord('A') + 10
    if char.islower():
        return ord(char) - ord('a') + 36
    if char == '-':
        return 62
    if char == '_':
        return 63

st = sys.stdin.next()


letters = [s for s in st]
expn = sum([6 - cntbinaryones(lettertonum(s)) for s in st[:-1] ])

print pow3mod(expn, 10**9 + 7)


