Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 9;
const int MX = 1e5 + 5;
string s;
int inp[MX];
int cnt[65];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  ;
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    int tmp;
    tmp = s[i];
    if (s[i] == '-')
      inp[i] = 62;
    else if (s[i] == '_')
      inp[i] = 63;
    else if (tmp >= 48 and tmp <= 57)
      inp[i] = tmp - 48;
    else if (tmp >= 65 and tmp <= 90)
      inp[i] = tmp - 65 + 10;
    else if (tmp >= 97 and tmp <= 122)
      inp[i] = tmp - 97 + 36;
  }
  for (int i = 0; i <= 63; i++)
    for (int j = 0; j <= 63; j++) cnt[i & j]++;
  long long ans = 1;
  for (int i = 0; i < s.size(); i++) ans = (ans * 1LL * cnt[inp[i]]) % MOD;
  cout << ans << endl;
  return 0;
}