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 Main {
  static String str;
  static int[] s;
  static long[] c;
  static final long M = 1000000007;

  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);

    str = sc.next();

    int n = str.length();
    s = new int[n];
    for(int i = 0; i < n; i++){
      char q = str.charAt(i);
      if('0' <= q && q <= '9'){
        s[i] = q - '0';
      }
      else if('A' <= q && q <= 'Z'){
        s[i] = q - 'A' + 10;
      }
      else if('a' <= q && q <= 'z'){
        s[i] = q - 'a' + 36;
      }
      else if(q == '-'){
        s[i] = 62;
      }
      else if(q == '_'){
        s[i] = 63;
      }
    }

    c = new long[64];
    for(int i = 0; i <= 63; i++){
      int count = 6;
      for(int j = 0; j < 6; j++){
        if((i & (1 << j)) != 0){
          --count;
        }
      }
      c[i] = pow(3, count);
    }

    long sum = 1;
    for(int i = 0; i < n; i++){
      sum = (sum * c[s[i]]) % M;
    }

    System.out.println(sum);
  }

  static int pow(int a, int b){
    int ret = 1;
    while(b > 0){
      ret *= a;
      --b;;
    }
    return ret;
  }
}
