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;
long long make(char q) {
  if (q == '-')
    return 62;
  else if (q == '_')
    return 63;
  else if (q >= '0' && q <= '9')
    return q - '0';
  else if (q >= 'A' && q <= 'Z')
    return 10 + q - 'A';
  else if (q >= 'a' && q <= 'z')
    return 10 + 'z' - 'a' + 1 + q - 'a';
}
string decToBinary(long long n) {
  string ans = "";
  for (long long i = 5; i >= 0; i--) {
    long long k = n >> i;
    if (k & 1)
      ans += "1";
    else
      ans += "0";
  }
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  long long n = s.length();
  long long dp[64] = {0};
  for (long long i = 0; i < 64; i++) {
    string s = decToBinary(i);
    long long ans1 = 1;
    for (long long i = 0; i < 6; i++) {
      if (s[i] == '1')
        ans1 *= 1;
      else
        ans1 *= 3;
    }
    dp[i] = ans1;
  }
  long long cnt[64] = {0};
  for (long long i = 0; i < 64; i++)
    for (long long j = 0; j < 64; j++) cnt[i & j]++;
  long long ans = 1;
  for (long long i = 0; i < n; i++) {
    long long x = make(s[i]);
    ans *= dp[x];
    ans %= 1000000007;
  }
  ans % 1000000007;
  cout << ans;
}