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
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-15;
const double pi = acos(-1.0);
const int inf = (int)1e9 + 7;
const long long mod = (long long)1e9 + 7;
const int N = 1e5 + 5;
vector<char> v;
map<int, long long> cnt;
int get_dec(char x) {
  if ('0' <= x && x <= '9') {
    return x - '0';
  } else if ('A' <= x && x <= 'Z') {
    return x - 'A' + 10;
  } else if ('a' <= x && x <= 'z') {
    return x - 'a' + 36;
  } else if (x == '-') {
    return 62;
  } else if (x == '_') {
    return 63;
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  for (char i = '0'; i <= '9'; i++) {
    v.emplace_back(i);
  }
  for (char i = 'A'; i <= 'Z'; i++) {
    v.emplace_back(i);
  }
  for (char i = 'a'; i <= 'z'; i++) {
    v.emplace_back(i);
  }
  v.emplace_back('-');
  v.emplace_back('_');
  for (int i = 0; i < v.size(); i++) {
    for (int j = 0; j < v.size(); j++) {
      cnt[get_dec(v[i]) & get_dec(v[j])]++;
    }
  }
  string s;
  cin >> s;
  long long ans = 1;
  for (int i = 0; s[i]; i++) {
    ans *= cnt[get_dec(s[i])];
    ans %= mod;
  }
  cout << ans << '\n';
}
