#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long sign = 1;
  long long x = 0;
  char ch;
  while (!isdigit(ch = getchar()))
    if (ch == '-') sign = -1;
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x * sign;
}
inline void write(long long k) {
  if (k < 0) putchar('-'), k *= -1;
  char ch[20];
  int num = 0;
  while (k) ch[++num] = k % 10, k /= 10;
  if (num == 0) ch[++num] = 0;
  while (num) putchar(ch[num--] + '0');
  putchar('\n');
}
const long long MOD = 1e9 + 7;
char ch;
long long num, sum, a[] = {729, 243, 81, 27, 9, 3, 1};
int main() {
  sum = 1;
  while (1) {
    ch = getchar();
    if (ch == -1) break;
    if (ch >= '0' && ch <= '9')
      num = ch - '0';
    else if (ch >= 'A' && ch <= 'Z')
      num = ch - 'A' + 10;
    else if (ch >= 'a' && ch <= 'z')
      num = ch - 'a' + 36;
    else if (ch == '-')
      num = 62;
    else
      num = 63;
    sum = (sum * a[__builtin_popcount(num)]) % MOD;
  }
  write(sum);
  return 0;
}

### Prompt

Please create a solution in cpp 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;
inline long long read() {
  long long sign = 1;
  long long x = 0;
  char ch;
  while (!isdigit(ch = getchar()))
    if (ch == '-') sign = -1;
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  return x * sign;
}
inline void write(long long k) {
  if (k < 0) putchar('-'), k *= -1;
  char ch[20];
  int num = 0;
  while (k) ch[++num] = k % 10, k /= 10;
  if (num == 0) ch[++num] = 0;
  while (num) putchar(ch[num--] + '0');
  putchar('\n');
}
const long long MOD = 1e9 + 7;
char ch;
long long num, sum, a[] = {729, 243, 81, 27, 9, 3, 1};
int main() {
  sum = 1;
  while (1) {
    ch = getchar();
    if (ch == -1) break;
    if (ch >= '0' && ch <= '9')
      num = ch - '0';
    else if (ch >= 'A' && ch <= 'Z')
      num = ch - 'A' + 10;
    else if (ch >= 'a' && ch <= 'z')
      num = ch - 'a' + 36;
    else if (ch == '-')
      num = 62;
    else
      num = 63;
    sum = (sum * a[__builtin_popcount(num)]) % MOD;
  }
  write(sum);
  return 0;
}

```