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.*;
import java.math.BigInteger;
import java.util.*;
public class C3555{
public static long mod = 1000000007;
public static int map[][];
public static int dx[] = {0,1,1,1,0,-1,-1,-1};
public static int dy[] = {-1,-1,0,1,1,1,0,-1};
public static void main(String args[]) throws IOException{
BufferedReader lector = new BufferedReader(new InputStreamReader(System.in));
String t = lector.readLine();
StringBuilder sb = new StringBuilder("");
long res = 1L;
long pow[] = new long[8];
pow[0]=1L;
for(int n = 1;n<8;n++)pow[n]=3L*pow[n-1];
for(int n = 0;n<t.length();n++){
char a = t.charAt(n);
int ta = 0;
if(a>='0' && a<='9'){
ta = a-'0';
}else if(a>='A' && a<='Z'){
ta = 10+a-'A';
}else if(a>='a' && a<='z'){
ta = 36+a-'a';
}else{
if(a=='-')ta = 62;
else ta = 63;
}
int co = 0;
//System.out.println(ta);
for(int nn = 0;nn<6;nn++,ta/=2)
if(ta%2==0)co++;
//System.out.println(co);
res=(res*pow[co])%mod;
}
System.out.println(res);
}
}
class p implements Comparable{
int a,b;
public p(int a,int b){
this.a = a;
this.b = b;
}
public int compareTo(Object o){
p pp = (p)o;
return (int)Math.signum(this.a-pp.a);
}
}