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
word = input()
count = 0
for s in word:
	count = count - 2
	if(s=='0'):
		count += 8
	elif(s=='1'):
		count += 7
	elif(s=='2'):
		count += 7
	elif(s=='3'):
		count += 6
	elif(s=='4'):
		count += 7
	elif(s=='5'):
		count += 6
	elif(s=='6'):
		count += 6
	elif(s=='7'):
		count += 5
	elif(s=='8'):
		count += 7
	elif(s=='9'):
		count += 6
	elif(s=='A'):
		count += 6
	elif(s=='B'):
		count += 5
	elif(s=='C'):
		count += 6
	elif(s=='D'):
		count += 5
	elif(s=='E'):
		count += 5
	elif(s=='F'):
		count += 4
	elif(s=='G'):
		count += 7
	elif(s=='H'):
		count += 6
	elif(s=='I'):
		count += 6
	elif(s=='J'):
		count += 5
	elif(s=='K'):
		count += 6
	elif(s=='L'):
		count += 5
	elif(s=='M'):
		count += 5
	elif(s=='N'):
		count += 4
	elif(s=='O'):
		count += 6
	elif(s=='P'):
		count += 5
	elif(s=='Q'):
		count += 5
	elif(s=='R'):
		count += 4
	elif(s=='S'):
		count += 5
	elif(s=='T'):
		count += 4
	elif(s=='U'):
		count += 4
	elif(s=='V'):
		count += 3
	elif(s=='W'):
		count += 7
	elif(s=='X'):
		count += 6
	elif(s=='Y'):
		count += 6
	elif(s=='Z'):
		count += 5
	elif(s=='a'):
		count += 6
	elif(s=='b'):
		count += 5
	elif(s=='c'):
		count += 5
	elif(s=='d'):
		count += 4
	elif(s=='e'):
		count += 6
	elif(s=='f'):
		count += 5
	elif(s=='g'):
		count += 5
	elif(s=='h'):
		count += 4
	elif(s=='i'):
		count += 5
	elif(s=='j'):
		count += 4
	elif(s=='k'):
		count += 4
	elif(s=='l'):
		count += 3
	elif(s=='m'):
		count += 6
	elif(s=='n'):
		count += 5
	elif(s=='o'):
		count += 5
	elif(s=='p'):
		count += 4
	elif(s=='q'):
		count += 5
	elif(s=='r'):
		count += 4
	elif(s=='s'):
		count += 4
	elif(s=='t'):
		count += 3
	elif(s=='u'):
		count += 5
	elif(s=='v'):
		count += 4
	elif(s=='w'):
		count += 4
	elif(s=='x'):
		count += 3
	elif(s=='y'):
		count += 4
	elif(s=='z'):
		count += 3
	elif(s=='-'):
		count += 3
	elif(s=='_'):
		count += 2
print (3**count % 1000000007)
	