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

import org.omg.Messaging.SyncScopeHelper;

public class VanyaLabel {

	static long[][] Comb;

	public static void main(String[] args) throws IOException {
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String s = bf.readLine();

		int n = s.length();
		int[] N = new int[n];

		for (int i = 0; i < n; i++) {
			int a = s.charAt(i);

			if (a >= 48 && a <= 57) {
				// System.out.println("0-9");
				a -= 48;
			} else {
				if (a >= 97 && a <= 122) {
					// System.out.println("a-z");
					a -= 97;
					a += 36;
				} else {
					if (a >= 65 && a <= 90) {
						// System.out.println("A-Z");
						a -= 65;
						a += 10;
					} else {
						if (a == 45) {
							// System.out.println("-");
							a = 62;
						} else {
							if (a == 95) {
								// System.out.println("_");
								a = 63;
							}
						}
					}
				}
			}
			N[i] = a;

		}
		/*
		 * for (int i = 0; i < n; i++) { System.out.print(N[i] + "-"); }
		 * System.out.println("");
		 */
		int contCero = 0;
		int contUno = 0;

		for (int i = n - 1; i >= 0; i--) {
			String bin = Integer.toBinaryString(N[i]);
			int l = bin.length();
			int Unos = 0;

			// System.out.println("---");
			// System.out.println(bin);

			for (int j = 0; j <= 6; j++) {
				if (j == l) {
					contCero += 6 - j;
					break;
				}
				char c = bin.charAt(j);
				if (c == '0') {
					contCero++;
				} else {
					contUno++;
				}
			}
			// System.out.println(contUno);
			// System.out.println(contCero);
		}

		// System.out.println("---");
		// System.out.println(contCero);
		// System.out.println("---");

		long mod = modulo(contCero);

		System.out.println(mod);
	}

	private static long modulo(int i) {
		if (i <= 10) {
			return (long) Math.pow(3, i) % 1000000007;
		} else {
			return (modulo(i - 10) * (long) Math.pow(3, 10) % 1000000007) % 1000000007;
		}
	}

}
