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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author zodiacLeo
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC
    {
        public final static int MOD = (int) 1e9 + 7;

        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int c[] = new int[64];
            for (int num = 0; num < 64; num++)
            {
                for (int j = 0; j < 64; j++)
                {
                    c[(num & j)]++;
                }
            }
            String s = in.next();
            long result = 1;
            for (int i = 0; i < s.length(); i++)
            {
                char ch = s.charAt(i);
                long cbs = c[getDecimal(ch)];
                result = (result * cbs) % MOD;
            }
            out.println(result);
        }

        public int getDecimal(char ch)
        {
            if (ch >= '0' && ch <= '9')
            {
                return ch - '0';
            } else if (ch >= 'A' && ch <= 'Z')
            {
                return ch - 'A' + 10;
            } else if (ch >= 'a' && ch <= 'z')
            {
                return ch - 'a' + 36;
            } else if (ch == '-')
            {
                return 62;
            }
            return 63;
        }

    }
}

