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
from sys import stdin

result = 1
MD = 10**9 + 7

def charToInt( c):
	assert( len(c) == 1)
	val = -1
	if c in '0123456789':
		val = int( c)
	elif c in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ':
		val = ord( c)-55
	elif c in 'abcdefghijklmnopqrstuvwxyz':
		val = ord( c)-61
	elif c == '-':
		val = 62
	elif c == '_':
		val = 63
	# else:
	# 	print( "ERROR")
	return val


def solve( string):
	global result, MD
	for c in string:
		val = charToInt( c)
		# print( val)
		binstring = bin( val)[2:]
		# print( binstring)
		cnt = 0
		for c2 in binstring:
			if c2 == '1': cnt += 1
		# print( cnt)
		num2 = 6-cnt
		for x in range( num2):
			result = (result*3)%MD


def parse():
	global result
	line = input()
	solve( line)
	print( result)
	result = 1

parse()