#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int _x;
  scanf("%d", &_x);
  return _x;
}
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const int maxn = (int)1e5 + 5;
const int logn = 20;
const int sqrtn = 1e3 + 5;
char q[maxn];
int N, ans[100];
int get(char a) {
  if (a >= '0' && a <= '9') return a - '0';
  if (a >= 'A' && a <= 'Z') return a - 'A' + 10;
  if (a >= 'a' && a <= 'z') return a - 'a' + 36;
  if (a == '-') return 62;
  return 63;
}
int mul(int a, int b) {
  long long int x = (long long int)a * b % mod;
  x %= mod;
  return x;
}
int main() {
  scanf("%s", q + 1);
  N = strlen(q + 1);
  for (int i = 0; i <= 63; i++)
    for (int j = 0; j <= 63; j++) ans[(i & j)]++;
  int res = 1;
  for (int i = 1; i <= N; i++) {
    int a = get(q[i]);
    res = mul(res, ans[a]);
  }
  cout << res << endl;
  return 0;
}
