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.HashMap;
import java.util.Map;
import java.util.Scanner;


/**
 * Created on 6/5/16.
 */

public class VanyaAndLabel {
    private static final int MOD = (int) (1e9+7);
    private static Map<Character,Integer> map;
    private static Map<Character,Integer> characterCountMap;


    private static void init(){
        map = new HashMap<>();
        characterCountMap = new HashMap<>();
        int ctr = 0 ;
        for (char i = '0' ; i <= '9' ; i++){
            map.put(i,ctr);
            ctr++;
        }
        for(char i = 'A' ; i <='Z' ;i++){
            map.put(i,ctr);
            ctr++;
        }
        for(char i = 'a' ; i <='z' ;i++){
            map.put(i,ctr);
            ctr++;
        }
        map.put('-',ctr);
        ctr ++;
        map.put('_',ctr);

        for (Character c1 : map.keySet()){
            int n1 = map.get(c1);
            int res = 0;
            for (Character c2 : map.keySet()) {
                int n2 = map.get(c2);
                for (Character c3 : map.keySet()) {
                    int n3 = map.get(c3);

                    int t = n2&n3;
                    if(t==n1){
                        res ++ ;
                    }

                }
            }
            characterCountMap.put(c1,res);
        }
    }

    public static void main(String[] args) {

        Scanner reader = new Scanner(System.in);
        String str = reader.nextLine();
        //String str = "Codeforces";
        init();
        long res = 1;
        for (int i = 0; i < str.length() ; i++) {
           // System.out.println(map.get(str.charAt(i)));
            res *= characterCountMap.get(str.charAt(i));
            res = res% MOD;
        }
        if(res<0) res += MOD;
        System.out.println(res);
    }
}
