Problem: 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

Solution (in PYTHON):

Solution:
import math
s = raw_input()
memo = {}

a = 0
for c in s:
    n = ord(c)
    if ord('0') <= n <= ord('9'):
        n = n-48
    elif ord('A') <= n <= ord('Z'):
        n = n-55
    elif ord('a') <= n <= ord('z'):
        n = n-61
    elif c == '_':
        n = 63
    elif c == '-':
        n = 62
    b = bin(n)[2:]
    z = 6-len(b)+b.count('0')
    a += z
    #if z in memo:
    #    ret *= memo[z]
    #else:
    #    f = sum([(math.factorial(z)/(math.factorial(k)*math.factorial(z-k))) * 2**(z-k) for k in range(z+1)])
    #    memo[z] = f
    #    ret *= f

ret = 3**a
print ret%(10**9+7)