#include <bits/stdc++.h>
using namespace std;
const int N = 200000;
struct node {
  int x;
  int y;
} b[N];
bool cmp(struct node a, struct node b) {
  if (a.x < b.x) {
    return true;
  }
  return false;
}
int main() {
  char a[N];
  while (cin >> a) {
    int num;
    long long int ans = 1;
    for (int i = 0; i < strlen(a); i++) {
      if (a[i] >= '0' && a[i] <= '9') {
        num = a[i] - '0';
      } else if (a[i] >= 'A' && a[i] <= 'Z') {
        num = a[i] - 'A' + 10;
      } else if (a[i] >= 'a' && a[i] <= 'z') {
        num = a[i] - 'a' + 36;
      } else if (a[i] == '-') {
        num = 62;
      } else {
        num = 63;
      }
      for (int j = 0; j <= 5; j++) {
        if (((num >> j) & 1) == 0) {
          ans = ans * 3 % 1000000007;
        }
      }
    }
    cout << ans << endl;
  }
  return 0;
}
