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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;


public class TestClass {

	/**
	 * @param args
	 */
	static PrintWriter out = new PrintWriter(System.out);
	static int cnt=0;
	public static void main(String[] args) throws Exception{
		// TODO Auto-generated method stub

		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String s = in.readLine();
		for(int i=0;i<s.length();i++)
		{
			char c = s.charAt(i);
			if(c>='0' && c<='9')
			{
				int a = c-'0';
				String str = String.valueOf(a);
				long x = Long.parseLong(str);
				//System.out.println(x);
				cnt += bin(x);
			}
			else if(c>='a' && c<='z')
			{
				int x ='a';
				int a =(c - x + 36);
				String str = String.valueOf(a);
				long b = Long.parseLong(str);
				//System.out.println(b);
				cnt += bin(b);
			}
			else if(c>='A' && c<='Z')
			{
				int x ='A';
				int a =(c - x + 10);
				String str = String.valueOf(a);
				long b = Long.parseLong(str);
				//System.out.println(b);
				cnt += bin(b);
			}
			else if(c=='-')
			{
				String str = String.valueOf(62);
				long x = Long.parseLong(str);
				cnt += bin(x);
			}
			else if(c=='_')
			{
				String str = String.valueOf(63);
				long x = Long.parseLong(str);
				//System.out.println(x);
				cnt += bin(x);
			}
		}

		out.println(power(3,cnt,(long)1e9+7));
		out.close();
	}

	public static long bin(long x)
	{
		long c=0;
		int i = 0;
		while(i<6)
		{
			long y = x%2;
			x=x/2;
			if(y==0)
			{
				c++;
			}
			i++;
		}
		return c;
	}
	public static long power(long a ,long b,long c)
	{
		long ans=1;
		while(b!=0)
		{
			if(b%2==1)
			{
				ans = ans*a;
				ans = ans%c;
			}
			a = a*a;
			a=a%c;
			b=b/2;
		}
		return ans;
	}
}
