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.util.Scanner;

public class B {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n=0;
		long acc = 1;
		String s = sc.next();
		char[] cs = s.toCharArray();
		boolean go = true;
		for (int i = 0 ; i < cs.length; i++) {
			if (cs[i]- '0'>= 0 && cs[i]- '9' <= 0) {
				n = (int)(cs[i] - '0'); 
			}else if (cs[i]- 'a'>= 0 && cs[i]- 'z' <= 0) {
				n = (int)(cs[i] - 'a') + 36; 
			}else if (cs[i]- 'A'>= 0 && cs[i]- 'Z' <= 0) {
				n = (int)(cs[i] - 'A') + 10; 
			}else if (cs[i] == '-') {
				n = 62;
			}else if (cs[i] == '_') {
				n = 63;
			} else {
				go = false;
			}
			//System.out.println("c: "+cs[i] + " n: " + n + " acc: " + acc + " " + (cs[i]- '0')+ " " + (cs[i]- '9'));
			for (int j = 0 ; j < 6; j++) {
				acc*=(n%2 == 0? 3:1);
				n /=2;
				acc%=1000000007;
			}
		}
		System.out.println(acc);
		
	}
}
