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 convert(x):
    if x>='A' and x<='Z':
        return (ord(x)-ord('A'))+10
    if x>='a' and x<='z':
        return (ord(x)-ord('a'))+36
    if x>='0' and x<='9':
        return (ord(x)-ord('0'))
    if x=='-':
        return 62
    return 63

def ones(n):
    r = 0
    while n!=0 :
        n&=n-1
        r+=1
    return r

def zeros(x):
    return 6 - ones(x)

# def zeros(x):
#     i=1 
#     res=0
#     while i<=x:
#         if (i&x) ==0:
#             res+=1
#         i= i<<1
#     return res

def pow (a , b , mod = 10**9+7):
    res = 1
    while b > 0 :
        if (b&1) == 0 :
            a = (a*a) % mod
            b = b>>1
        else:
            res= (res*a) %mod
            b-=1
    return res

def main():
    x = sys.stdin.readline().rstrip()
    t = 0
    for s in x:
        v = convert(s)
        z = zeros(v)
        t+=z

    print(pow(3,t))

main()
