#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
  string S; cin >> S;
  map<string,int> dic;
  for(int i = 0; i < (1 << 8);i++) {
    string s = S;
    for(int j = 0; j <8; j++) {
      if(i & (1 << j)) {
        if(s[j] == 'l') {
          s[j] = '1';
        }
        if(s[j] == 'o') {
          s[j] = '0';
        }
        if(s[j] == 'a') {
          s[j] = '@';
        }
        if(s[j] == 's') {
          s[j] = '$';
        }
      }
    }
    dic[s]++;
  }
  string alpha = "abcdefghijklmnopqrstuvwxyz";
  string num = "0123456789";
  int count = 0;
  for (const auto& [key, value] :dic) {
    bool A = false;
    bool B = false;
    bool C = false;
    for(int i = 0; i < 8; i++) {
      for(int j = 0; j < 26; j++) {
        if(alpha[j] == key[i]) {
          A = true;
        }
      }
      for(int j = 0; j < 10; j++) {
        if(num[j] == key[i]) {
          B = true;
        }
      }
      if('@' == key[i] || '$' == key[i]) {
        C = true;
      }
    }
    if(A && B && C) {
      count++;
    }
  }
  cout << count << endl;
}