#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897932384626;
const long long int MAX = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
inline long long int add(long long int a, long long int b, long long int mod) {
  long long int c = (long long int)((long long int)(a) + (long long int)(b));
  while (c >= mod) {
    c -= mod;
  };
  while (c < 0) {
    c += mod;
  };
  return c;
}
inline long long int sub(long long int a, long long int b, long long int mod) {
  return add(a, mod - b, mod);
}
inline long long int mul(long long int a, long long int b, long long int mod) {
  long long int c = (long long int)((long long int)(a) * (long long int)(b));
  c %= mod;
  while (c < 0) {
    c += mod;
  };
  return c;
}
inline long long int mod_pow(long long int a, long long int n,
                             long long int b) {
  long long int res = 1;
  while (n) {
    if (n & 1) {
      res = mul(res, a, b);
    }
    a = mul(a, a, b);
    n >>= 1;
  }
  return add(res, 0, b);
}
inline long long int mod_div(long long int a, long long int b,
                             long long int mod) {
  long long int ans = mul(a, mod_pow(b, mod - 2, mod), mod);
  return ans;
}
long long int cnt[100 + 1];
void calc() {
  for (int i = 0; i <= 63; i++) {
    for (int j = 0; j <= 63; j++) {
      cnt[i & j]++;
    }
  }
}
int main(int argc, char const *argv[]) {
  calc();
  string a;
  cin >> a;
  long long int ans = 1;
  for (int i = 0; i < a.size(); i++) {
    if (a[i] == '-') {
      int by = 62;
      ans = mul(ans, cnt[by], MAX);
    } else if (a[i] == '_') {
      int by = 63;
      ans = mul(ans, cnt[by], MAX);
    } else if (a[i] >= '0' and a[i] <= '9') {
      int by = a[i] - '0';
      ans = mul(ans, cnt[by], MAX);
    } else if (a[i] >= 'a' and a[i] <= 'z') {
      int by = a[i] - 'a' + 36;
      ans = mul(ans, cnt[by], MAX);
    } else if (a[i] >= 'A' and a[i] <= 'Z') {
      int by = a[i] - 'A' + 10;
      ans = mul(ans, cnt[by], MAX);
    }
  }
  cout << ans << endl;
  return 0;
}
