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
/*
 * Code Author: Jayesh Udhani
 * Institute  : DA-IICT 
 * 3rd year BTech ICT Student
 */

import java.io.*;
import java.util.*;
public class Vanya_and_label
{
	static int[] helper;
	static float NcR(int n,int r)
	{
		if(r==0)
			return 1.0f;
		if(n-r<r)
			return NcR(n, n-r);
		else
			return (n/(r*1.0f))*NcR(n-1, r-1);
	}
	public static void main(String args[])
	{
		InputReader in = new InputReader(System.in);
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		helper=new int[7];
		Arrays.fill(helper, 0);
		int i=0,j,k,cnt=0;
		String s=in.next(),t;
		for(;i<=6;i++)
		{
			for(j=0;j<=i;j++)
			{
				for(k=0;k<=j;k++)
					helper[i]+=(int)NcR(i, k)*(int)NcR(i-k, j-k);
			}
		}
		long l=(int)(1e9)+7;
		Map<Character, Integer> map=new HashMap<>();
		i=1;
		map.put('0',helper[6] );
		for(char c='1';c<='9';c++)
		{
			cnt=0;
			t=Integer.toBinaryString(i);
			for(j=0;j<t.length();j++)
			{
				if(t.charAt(j)=='0')
					cnt++;
			}
			cnt+=6-t.length();
			map.put(c, helper[cnt]);
			i++;
		}
		for(char c='A';c<='Z';c++)
		{
			cnt=0;
			t=Integer.toBinaryString(i);
			for(j=0;j<t.length();j++)
			{
				if(t.charAt(j)=='0')
					cnt++;
			}
			cnt+=6-t.length();
			map.put(c, helper[cnt]);
			i++;
		}
		for(char c='a';c<='z';c++)
		{
			cnt=0;
			t=Integer.toBinaryString(i);
			for(j=0;j<t.length();j++)
			{
				if(t.charAt(j)=='0')
					cnt++;
			}
			cnt+=6-t.length();
			map.put(c, helper[cnt]);
			i++;
		}
		cnt=0;
		t=Integer.toBinaryString(62);
		for(j=0;j<t.length();j++)
		{
			if(t.charAt(j)=='0')
				cnt++;
		}
		cnt+=6-t.length();
		map.put('-', helper[cnt]);
		cnt=0;
		t=Integer.toBinaryString(63);
		for(j=0;j<t.length();j++)
		{
			if(t.charAt(j)=='0')
				cnt++;
		}
		cnt+=6-t.length();
		map.put('_', helper[cnt]);
		long ans=1;
		for(i=0;i<s.length();i++)
		{
			ans*=(long) map.get(s.charAt(i));
			ans%=l;	
		}
		out.println(ans);
		out.close();
	}
	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream inputstream) {
			reader = new BufferedReader(new InputStreamReader(inputstream));
			tokenizer = null;
		}

		public String nextLine(){
			String fullLine=null;
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					fullLine=reader.readLine();
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				return fullLine;
			}
			return fullLine;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}
		public long nextLong() {
			return Long.parseLong(next());
		}
		public int nextInt() {
			return Integer.parseInt(next());
		}
	}
}