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.*;


public class JavaApplication64 {

    
 
public static void main(String[] args) {
		      		Scanner in=new Scanner(System.in);                      
                
       String input = in.nextLine();
        long zeroes = 0;
     for(char f: input.toCharArray()) {

        
            long i = GenerateValue(f);
 
            for (int j = 5; j >= 0; j--)
            { 
                if (((i >> j) & 1) == 0)
                zeroes++;
            }
        }
 
        long result = 1;
        long mod = (long)(Math.pow(10, 9))+7;
 
        for (long i = 0; i < zeroes; i++)
        {
            result *= 3;
            result %= mod;
        }
 
        System.out.println(result);
    }
 
    static long GenerateValue(char my_char)
    {
        if (my_char >= '0' && my_char <= '9')
            return my_char-'0';
        if (my_char >= 'a' && my_char <= 'z')
            return my_char - 'a' + 36;
        if (my_char >= 'A' && my_char <= 'Z')
            return my_char - 'A' + 10;
        if (my_char == '-')
            return 62;
        return 63;
                                
}}