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.util.Arrays;
import java.util.StringTokenizer;


public class Div355 {

	
	static long bc[]=new long[64];
	
	public static void main(String[] args) 
	{
		// TODO Auto-generated method stub
		MyScannerd355 sc=new MyScannerd355();
		String s=sc.next();
		Arrays.fill(bc, -1);
		int i;
		long v=1;
		for(i=0;i<s.length();i++)
		{
			long num=0;
			char c=s.charAt(i);
			if(c>=97 && c<=122)
				num=c-97+36;
			else if(c>=65 && c<=90)
				num=c-65+10;
			else if(c=='_')
				num=63;
			else if(c=='-')
				num=62;
			else
				num=c-'0';
			
				v=v*b(num);
				
				v=v%1000000007;
			
		}
		
		
		System.out.println(v);

	}
	static long b(long n)
	{
		if(bc[(int) n]!=-1)
			return bc[(int) n];
		else
		{
			long total=1;
			int count=0;
			while(count!=6)
			{
				if(((n>>count)&1)==0)
					total*=3;
				count++;
			}
			
			bc[(int) n]=total;
			
			return (total);
		}
	}

}
class MyScannerd355
{
	BufferedReader br;
	StringTokenizer st;
	MyScannerd355()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	String next()
	{
		
		while(st==null || !st.hasMoreTokens())
		{
			try
			{
				st=new StringTokenizer(br.readLine());
			}
			catch(Exception e)
			{
				e.printStackTrace();
			}
		}
		return st.nextToken();
		
	}
	int nextInt()
	{
		return Integer.parseInt(next());
	}
	long nextLong()
	{
		return Long.parseLong(next());
	}
	double nextDouble()
	{
		return Double.parseDouble(next());
	}
	String nextLine()
	{
		String str="";
		try
		{
			str=br.readLine();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
		return str;
		
	}
}