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;

/**
 * Jun 1, 2016 | 5:31:38 PM
 * <pre>
 * <u>Description</u>
 *
 * </pre>
 *
 * @author Essiennta Emmanuel (colourfulemmanuel@gmail.com)
 */
public class ProblemC {
    
    final static int MOD = (int) 1e9 + 7;

    int exp_mod(long a, long n){
        long res = 1;
        while (n > 0) {
            if ((n & 1) != 0)
                res = res * a % MOD;
            a = a * a % MOD;
            n >>= 1;
        }
        return (int)res;
    }
    
    int solve(String s) {
        int total = 0;
        for (int i = 0; i < s.length(); i++) {
            char ch = s.charAt(i);
            int x;
            if ('0' <= ch && ch <= '9')
                x = ch - '0';
            else if ('A' <= ch && ch <= 'Z')
                x = 10 + ch - 'A';
            else if ('a' <= ch && ch <= 'z')
                x = 36 + ch - 'a';
            else if (ch == '-')
                x = 62;
            else
                x = 63;
            int zeroBitCount = 6 - Integer.bitCount(x);
            total += zeroBitCount;
        }
        return exp_mod(3, total);
    }
    
    public static void main(String[] args){
        try (Scanner sc = new Scanner(System.in)) {
            System.out.println(new ProblemC().solve(sc.next()));
        }
    }
}
