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.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;

public class Main
{
	public static void main(String[] args)
	throws IOException
	{
		Reader r = new Reader();
		r.readLine();

		int []count = new int[64];
		int res;
		for (int i=0;i < 64;++i)
		{
			for (int j=0;j < 64;++j)
			{
				res = i & j;

				if (res > -1 && res < 64)
				{
					++count[res];
				}
			}
		}


		HashMap<Character,Integer> map = new HashMap<Character,Integer>();

		for (char ch='0';ch <= '9';++ch)
			map.put(ch, count[ch - '0']);

		for (char ch='A';ch <= 'Z';++ch)
			map.put(ch, count[ch - 'A' + 10]);

		for (char ch='a';ch <= 'z';++ch)
			map.put(ch, count[ch - 'a' + 36]);

		map.put('-', count[62]);
		map.put('_', count[63]);

		String str = r.readString(0);

		long ans = 1L;
		for (char ch:str.toCharArray())
		{
			ans *= map.get(ch);
			ans %= 1000000007;
		}

		System.out.println(ans);


		r.close();
	}
}

class Reader
{
    private BufferedReader reader;
    private String line[];

    public Reader()
    {
        reader = new BufferedReader(
            new InputStreamReader(System.in));
    }

    public void readLine()
    throws IOException
    {
        line = reader.readLine().split(" ");
    }

    public int readInt(int pos)
    throws IOException
    {
        return Integer.parseInt(line[pos]);
    }

    public double readDouble(int pos)
    throws IOException
    {
        return Double.parseDouble(line[pos]);
    }

    public long readLong(int pos)
    throws IOException
    {
        return Long.parseLong(line[pos]);
    }

    public String readString(int pos)
    throws IOException
    {
        return line[pos];
    }

    public void close()
    throws IOException
    {
        reader.close();
    }
}