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 sys
import math

import string
from collections import Counter

def get_encoding():
    digits = {"%s" % i: i for i in range(10)}
    upper_letters = {"%s" % d: i for i, d in enumerate(string.uppercase, 10)}
    lower_letters = {"%s" % d: i for i, d in enumerate(string.lowercase, 36)}
    symbols = {"-": 62, "_": 63}
    encoding = {}
    encoding.update(digits)
    encoding.update(upper_letters)
    encoding.update(lower_letters)
    encoding.update(symbols)
    return encoding

def preprocess(encoding):
    preprocessed_encoding = {}
    for letter, value in encoding.iteritems():
        s = bin(value)[2:]
        if len(s) < 6:
            s += '0'* (6-(len(s)))
        c = Counter(s)
        preprocessed_encoding[letter] = max(3 ** c.get('0', 0), 1)
    return preprocessed_encoding

if __name__ == "__main__":

    encoding = get_encoding()
    preprocessed_encoding = preprocess(encoding)
    line = sys.stdin.readline().strip()
    changes = 1
    modulo = 10**9 + 7
    counter = Counter(line)
    for letter in line:
        changes *= preprocessed_encoding[letter]
        if changes > modulo:
            changes = changes % modulo

    print changes

