#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
const int mod = 1000000007;
char c[maxn + 5];
int b[] = {1, 2, 4, 8, 16, 32};
int e[] = {1, 3, 9, 27, 81, 243, 729};
int d[65];
int main() {
  scanf(" %s", &c);
  int l = strlen(c);
  for (int i = 0; i <= 63; ++i) {
    int x = i;
    d[i] = 0;
    for (int j = 5; j >= 0; --j) {
      if (x >= b[j])
        x -= b[j];
      else
        ++d[i];
    }
  }
  long long ans = 1;
  int x;
  for (int i = 0; i < l; ++i) {
    if (c[i] >= '0' && c[i] <= '9') {
      x = c[i] - '0';
    } else if (c[i] >= 'a' && c[i] <= 'z') {
      x = c[i] - 61;
    } else if (c[i] >= 'A' && c[i] <= 'Z') {
      x = c[i] - 55;
    } else if (c[i] == '-') {
      x = 62;
    } else {
      x = 63;
    }
    int y = d[x];
    ans = (ans * e[y]) % mod;
  }
  printf("%lld\n", ans);
  return 0;
}

### Prompt

Create a solution in CPP for 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;
const int maxn = 100000;
const int mod = 1000000007;
char c[maxn + 5];
int b[] = {1, 2, 4, 8, 16, 32};
int e[] = {1, 3, 9, 27, 81, 243, 729};
int d[65];
int main() {
  scanf(" %s", &c);
  int l = strlen(c);
  for (int i = 0; i <= 63; ++i) {
    int x = i;
    d[i] = 0;
    for (int j = 5; j >= 0; --j) {
      if (x >= b[j])
        x -= b[j];
      else
        ++d[i];
    }
  }
  long long ans = 1;
  int x;
  for (int i = 0; i < l; ++i) {
    if (c[i] >= '0' && c[i] <= '9') {
      x = c[i] - '0';
    } else if (c[i] >= 'a' && c[i] <= 'z') {
      x = c[i] - 61;
    } else if (c[i] >= 'A' && c[i] <= 'Z') {
      x = c[i] - 55;
    } else if (c[i] == '-') {
      x = 62;
    } else {
      x = 63;
    }
    int y = d[x];
    ans = (ans * e[y]) % mod;
  }
  printf("%lld\n", ans);
  return 0;
}

```