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
read = lambda: sys.stdin.readline().strip()
readi = lambda: map(int, read().split())
from collections import *
import string
mapping = dict()

for key in string.digits:
    mapping[key] = int(key)
start = 10
for key in string.ascii_uppercase:
    mapping[key] = start
    start += 1
for key in string.ascii_lowercase:
    mapping[key] = start
    start += 1
mapping['-'] = 62
mapping['_'] = 63


## Code starts here
def getCount(num):
    count = 0
    num = ~num
    for i in range(6):
        if num & 1 == 1:
            count += 1
        num = num >> 1
    return count

for key in mapping.keys():
    mapping[key] = getCount(mapping[key])

s = read()

ans = 1
mod = 10**9 + 7

for key in s:
    # print(key, mapping[key])
    ans = (ans * 3**mapping[key]) % mod
print(ans)