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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Reader;
import java.util.StringTokenizer;

// Codeforces Round #355 (Div. 2)
// Vanya and Label
public class Problem_677_C {

	private void doSolve(PrintWriter out) {
		String s = next();
		byte[] s64 = to64(s);

		int mod = 1000*1000*1000 + 7;
		int zeroes = 0;
		for (int i = 0; i < s64.length; i++) {
			for (int j = 0; j < 6; j++) {
				if (s64[i] % 2 == 0) {
					zeroes++;
				}
				s64[i] = (byte) (s64[i] >> 1);
			}
		}
		
		long count = 1;
		for (int i = 0; i < zeroes; i++) {
			count *= 3;
			if (count > mod) {
				count %= mod;
			}
		}
	
		out.println(count);
	}
	
	
	byte[] to64(String s) {
		byte[] result = new byte[s.length()];
		for (int i = 0; i < s.length(); i++) {
			char c = s.charAt(i);
			int value;
			if (c >= '0' && c <= '9' ) {
				value = c - '0';
			}
			else if (c >= 'A' && c <= 'Z') {
				value = c - 'A' + 10;
			}
			else if (c >= 'a' && c <= 'z') {
				value = c - 'a' + 36;
			}
			else if (c == '-') {
				value = 62;
			}
			else {
				value = 63;
			}
			result[i] = (byte) value;
		}
		return result;
	}

	
	/* ========================================================= */
	
    private InputReader inputReader;
    
    public static final int MOD = 1000000007;
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        PrintWriter out = new PrintWriter(outputStream);
        Problem_677_C solver = new Problem_677_C();
        solver.solve(1, new InputStreamReader(inputStream), out);
        out.close();
    }

    public int nextInt() {
    	return inputReader.nextInt();
    }
    
    public String next() {
    	return inputReader.next();
    }
    
    public void solve(int test, Reader in, PrintWriter out)
    {
    	inputReader = new InputReader(in);
    	doSolve(out);
    	
    }
    
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(Reader reader) {
            this.reader = new BufferedReader(reader, 32768);
            tokenizer = null;
        }

        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 int nextInt() {
            return Integer.parseInt(next());
        }

    }

}