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
//package set_677;

import java.util.Scanner;

public class C {

	public static int count(char c) {
		if (c >= '0' && c <= '9') {
			return cz(c - '0');
		}
		if (c >= 'A' && c <= 'Z') {
			return cz(c - 'A' + 10);
		}
		if (c >= 'a' && c <= 'z') {
			return cz(c - 'a' + 36);
		}
		if (c == '-') {
			return 1;
		}
		if (c == '_') {
			return 0;
		}
		return -1;
	}

	public static int cz(int n) {
		int c = 0;
		while (n > 0) {
			if (n % 2 == 1) {
				c++;
			}
			n /= 2;
		}
		return 6 - c;
	}

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		String s = input.nextLine();
		input.close();
		int c = 0;
		for (int i = 0; i < s.length(); i++) {
			c += count(s.charAt(i));
		}
		long x = 1;
		if (c == 0) {
			System.out.println(1);
			return;
		}
		while (c > 0) {
			if (c >= 10) {
				x = (x * (long) Math.pow(3, 10)) % (long) (Math.pow(10, 9) + 7);
				c -= 10;
			} else {
				x = (x * (long) Math.pow(3, c)) % (long) (Math.pow(10, 9) + 7);
				c = 0;
			}
		}
		System.out.println(x);
	}

}
