#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)LLONG_MAX;
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
int dx8[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int dy8[9] = {0, 1, 0, -1, 1, -1, 1, -1, 0};
long long ipow(long long base, long long exp) {
  long long result = 1;
  while (exp) {
    if (exp & 1) result *= base;
    exp >>= 1;
    base *= base;
  }
  return result;
}
string tos(long long n) {
  stringstream ss;
  string ans;
  ss << n;
  ss >> ans;
  return ans;
}
long long toll(string n) { return atoll(n.c_str()); }
double dist(double x1, double y1, double x2, double y2) {
  return sqrt(((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2)));
}
int doubleCompare(double x, double y) {
  if (fabs(x - y) <= 1e-100) return 0;
  if (x < y) return -1;
  return 1;
}
int main() {
  string x = "";
  for (char i = '0'; i <= '9'; i++) x += i;
  for (char i = 'A'; i <= 'Z'; i++) x += i;
  for (char i = 'a'; i <= 'z'; i++) x += i;
  x += '-';
  x += '_';
  map<char, int> nada;
  map<char, long long> dp;
  for (int i = 0; i < x.size(); i++) nada[x[i]] = i;
  for (int i = 0; i < x.size(); i++) {
    for (int j = 0; j < x.size(); j++) {
      for (int h = 0; h < x.size(); h++) {
        int a = (j & h);
        if (a == nada[x[i]]) dp[x[i]]++;
      }
    }
  }
  string s;
  cin >> s;
  long long ans = 1;
  for (int i = 0; i < s.size(); i++) {
    ans *= dp[s[i]];
    while (ans >= 1e9 + 7) ans -= 1e9 + 7;
    while (ans < 0) ans += 1e9 + 7;
  }
  cout << ans;
}
