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 int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
long long i, j;
long long n, k, m;
long long b[MAXN];
int wtf[MAXN];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  vector<pair<char, int> > alph;
  map<char, int> kek;
  int num = 0;
  for (char c = '0'; c <= '9'; c++) {
    kek[c] = num;
    alph.push_back({c, num});
    num++;
  }
  for (char c = 'A'; c <= 'Z'; c++) {
    kek[c] = num;
    alph.push_back({c, num});
    num++;
  }
  for (char c = 'a'; c <= 'z'; c++) {
    kek[c] = num;
    alph.push_back({c, num});
    num++;
  }
  kek['-'] = 62;
  kek['_'] = 63;
  alph.push_back({'-', 62});
  alph.push_back({'_', 63});
  for (i = 0; i < s.size(); i++) {
    wtf[i] = kek[s[i]];
  }
  for (i = 0; i < s.size(); i++) {
    for (j = 0; j < alph.size(); j++) {
      for (k = 0; k < alph.size(); k++) {
        int first = alph[j].second;
        int second = alph[k].second;
        if ((first & second) == wtf[i]) {
          b[i]++;
        }
      }
    }
  }
  long long ans = 1;
  for (i = 0; i < s.size(); i++) {
    ans *= b[i];
    ans %= MOD;
  }
  cout << ans;
  return 0;
}
