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

public class C {
	public static void solution(BufferedReader reader, PrintWriter out) throws IOException {
		In in = new In(reader);
		String s = in.next();
		long res = 1, mod = 1000 * 1000 * 1000 + 7;
		long[] a = new long[] { 1, 3, 9, 27, 81, 243, 729 };
		for (int i = 0; i < s.length(); i++) {
			res *= a[c(v(s.charAt(i)))];
			res %= mod;
		}
		out.println(res);
	}

	private static int c(int v) {
		return 6 - Integer.bitCount(v);
	}

	private static int v(char c) {
		if (c == '-')
			return 62;
		if (c == '_')
			return 63;
		if (c >= '0' && c <= '9')
			return c - '0';
		if (c >= 'A' && c <= 'Z')
			return 10 + c - 'A';
		return 36 + c - 'a';
	}

	public static void main(String[] args) throws Exception {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		solution(reader, out);
		out.close();
	}

	protected static class In {
		private BufferedReader reader;
		private StringTokenizer tokenizer = new StringTokenizer("");

		public In(BufferedReader reader) {
			this.reader = reader;
		}

		public String next() throws IOException {
			while (!tokenizer.hasMoreTokens())
				tokenizer = new StringTokenizer(reader.readLine());
			return tokenizer.nextToken();
		}

		public int nextInt() throws IOException {
			return Integer.parseInt(next());
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}
	}
}
