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.util.Scanner;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		String str = sc.nextLine();
		long[] perm = new long[64];
		int ones,temp;
		long[][] nCr = new long[7][7];
		
		for(int i=0;i<7;i++)
		{
			nCr[0][i] = 0;
			nCr[i][0] = 1;
		}	
		
		for(int i=1;i<7;i++)
			for(int j=1;j<7;j++)
				nCr[i][j] = nCr[i-1][j] + nCr[i-1][j-1];
		
		
		for(int i=0;i<64;i++)
		{
			ones=0;
			temp = i;
			
			while(temp!=0)
			{
				if(temp%2==1)
					ones++;
				temp = temp>>1;
			}
			
			for(int j=0;j<=(6-ones);j++)
			{
				temp = 1<<(6-ones-j);
				perm[i] = (perm[i]+ nCr[6-ones][j]*temp)%1000000007;
			}
		}
		
		//System.out.println(perm[61]);
		
		long ans=1;
		
		for(int i=0;i<str.length();i++)
		{
			if((int)str.charAt(i)>=(int)'0' && str.charAt(i)<=(int)'9')
				ans = (ans *perm[str.charAt(i)-'0'])%1000000007;
			else if((int)str.charAt(i)>=(int)'A' && str.charAt(i)<=(int)'Z')
				ans = (ans*perm[str.charAt(i)-'A'+10])%1000000007;
			else if((int)str.charAt(i)>=(int)'a' && str.charAt(i)<=(int)'z')
				ans = (ans*perm[str.charAt(i)-'a'+36])%1000000007;
			else if(str.charAt(i)=='-')
				ans = (ans*perm[62])%1000000007;
			else if(str.charAt(i)=='_')
				ans = (ans*perm[63])%1000000007;
		}
		//ans = ans<<1;
		//ans = (ans-1)%1000000007;
		
		if(ans<0)
			ans+=1000000007;
		
		System.out.println(ans);
		sc.close();
	}

}