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 JAVA):

Solution:
import java.io.*;
import java.util.*;

public class C {
public static void main(String[] args) throws IOException {
	//System.out.println(to64('V'));
	File file = new File("in");
	BufferedReader in;
	if ( file.exists() )
	{
		in = new BufferedReader(new FileReader(file));
	}
	else
	{
		in = new BufferedReader(new InputStreamReader(System.in));
	}
	int arr[];
	char cad[];
	String line, lines[];
	cad = in.readLine().toCharArray();
	arr = new int[cad.length];
	for( int i= 0; i<  cad.length; i++ )
	{
		arr[i] = to64(cad[i]);
	}
	System.out.println(cad(arr));
}
public static int to64(char a)
{
	if ( a >= '0' && a <= '9' ) return a-'0';
	if ( a >= 'A' && a <= 'Z' ) return a-'A'+10;
	if ( a >= 'a' && a <= 'z' ) return a-'a'+36;
	if ( a == '-' ) return 62;
	return 63;
}
public static long cad(int arr[])
{
	long result = 1l;
	int sum = 0;
	for( int i = 0; i < arr.length; i++ )
	{
		while( arr[i] > 0)
		{
			if ( arr[i] % 2 == 1) sum++;
			arr[i] >>= 1; 
		}
	}
	//System.out.println(sum);
	sum = arr.length*6-sum;
	//System.out.println(sum);
	for( int i = 0; i < sum; i++ )
	{
		result = (result*3l)%1000000007l;
	}
	return result;
}
public static long[] readInts(String line)
{
	String lines[] = line.split("\\s+");
	long[] result = new long[line.length()];
	for( int i = 0; i < lines.length; i++ ) result[i] = Integer.parseInt(lines[i]);
	return result;
}
}