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
/**
 *
 * @author sarthak
 */

import java.util.*;
import java.math.*;
import java.io.*;



public class rnd355_C {

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
static class P implements Comparable{

        private int x, y;

        public P(int x, int y) {
            this.x = x;
            this.y = y;
        }

        public int hashCode() {
            return (x * 31) ^ y;
        }

        public boolean equals(Object o) {
            if (o instanceof P) {
                P other = (P) o;
                return (x == other.x && y == other.y);
            }
            return false;
        }
        public int compareTo(Object obj) {
		P l = (P) obj;
		if (this.x == l.x){
			if (this.y == l.y) return 0;
			return (this.y < l.y)? -1: 1;
		}
		return (this.x < l.x)? -1: 1;
	}
    }
public static int tb(int n){
    String tbr="";
    while(n!=0){
        tbr=""+n%2+""+tbr;
        n=n/2;
    }
    int len=tbr.length();
    while(len!=6){
        tbr=""+0+""+tbr;
        len++;
       
    }
    int cn=0;
    for(int i=0;i<6;i++)
        if(tbr.charAt(i)=='0')
            cn++;
        
    return cn;
}

    public static void main(String[] args){
         
    FastScanner s = new FastScanner(System.in);
    StringBuilder op=new StringBuilder();
    String ip=s.next();
    ArrayList<Integer> al=new ArrayList<>();
    int len=ip.length();
    for(int i=0;i<len;i++){
        char c=ip.charAt(i);
        if(48<=c&&c<=57){
            al.add(tb((c-'0')));
            
            
        }
        else if(65<=c&&c<=90){
            al.add(tb((c-'A' + 10)));
         
        }
        else if(97<=c&&c<=122){
            al.add(tb((c-'a'+36)));
         
        }
        else if(c=='-')
            al.add(tb(62));
        else if(c=='_')
            al.add(tb(63));
    }
    long an=1;
    for(int i:al){
        an=(an%(1000000000+7)*(long)Math.pow(3, i)%(1000000000+7))%(1000000000+7);
    }
    System.out.println(an);
    
    
    
    
    }


}
