#include <bits/stdc++.h>
using namespace std;
int cnt[65];
const int mod = 1e9 + 7;
char s[100010];
map<int, int> mp;
int change(char ch) {
  if (ch >= '0' && ch <= '9') return ch - '0';
  if (ch >= 'A' && ch <= 'Z') return ch - 'A' + 10;
  if (ch >= 'a' && ch <= 'z') return ch - 'a' + 36;
  if (ch == '-') return 62;
  if (ch == '_') return 63;
}
long long mypow(long long n, long long t) {
  long long ans = 1;
  while (t) {
    if (t % 2 == 1) ans = ans * n % mod;
    n = n * n % mod;
    t >>= 1;
  }
  return ans;
}
int main() {
  long long ans = 1;
  mp.clear();
  for (int i = 0; i <= 63; i++) {
    int num = 0;
    for (int j = 0; j <= 63; j++) {
      for (int k = 0; k <= 63; k++) {
        if ((j & k) == i) {
          num++;
        }
      }
    }
    cnt[i] = num;
  }
  scanf("%s", s);
  int len = strlen(s);
  for (int i = 0; i < len; i++) mp[change(s[i])]++;
  for (int i = 0; i <= 64; i++) {
    if (mp[i]) {
      ans = ans * mypow((long long)cnt[i], (long long)mp[i]) % mod;
    }
  }
  printf("%I64d\n", ans);
  return 0;
}

### Prompt

Please formulate a Cpp solution to the following 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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int cnt[65];
const int mod = 1e9 + 7;
char s[100010];
map<int, int> mp;
int change(char ch) {
  if (ch >= '0' && ch <= '9') return ch - '0';
  if (ch >= 'A' && ch <= 'Z') return ch - 'A' + 10;
  if (ch >= 'a' && ch <= 'z') return ch - 'a' + 36;
  if (ch == '-') return 62;
  if (ch == '_') return 63;
}
long long mypow(long long n, long long t) {
  long long ans = 1;
  while (t) {
    if (t % 2 == 1) ans = ans * n % mod;
    n = n * n % mod;
    t >>= 1;
  }
  return ans;
}
int main() {
  long long ans = 1;
  mp.clear();
  for (int i = 0; i <= 63; i++) {
    int num = 0;
    for (int j = 0; j <= 63; j++) {
      for (int k = 0; k <= 63; k++) {
        if ((j & k) == i) {
          num++;
        }
      }
    }
    cnt[i] = num;
  }
  scanf("%s", s);
  int len = strlen(s);
  for (int i = 0; i < len; i++) mp[change(s[i])]++;
  for (int i = 0; i <= 64; i++) {
    if (mp[i]) {
      ans = ans * mypow((long long)cnt[i], (long long)mp[i]) % mod;
    }
  }
  printf("%I64d\n", ans);
  return 0;
}

```