#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <map>
#include <cmath>
#include <bitset>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <tuple>
#include <atcoder/all>
#include <sstream> // std::stringstream
#include <regex>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using namespace std;
using ll = long long;
static const double pi = 3.141592653589793;
const int INF = (1<<29);
const ll mod = 998244353;

bool check(char ch){
    return ch=='l' || ch=='o' || ch=='a' || ch=='s';
}

void change(string& s,int i){
    if(s[i]=='l') s[i]='1';
    else if(s[i]=='o') s[i]='0';
    else if(s[i]=='a') s[i]='@';
    else if(s[i]=='s') s[i]='$';
}

bool check(string s){
    bool ch = false;
    bool nu = false;
    bool sy = false;
    for(auto x:s){
        if('0' <= x && x <= '9') nu =  true;
        else if('a' <= x && x<='z') ch = true;
        else if('A' <= x && x<='Z');
        else sy = true;
    }
    return ch && nu && sy;
}

int main() {
  string s;cin >> s;
  vector<int> index;
  for(int i=0;i<s.size();i++){
    if(check(s[i])) index.push_back(i);
  }

  int ans = 0;
  for(int bit=0;bit<(1<<index.size());bit++){
    int tmp = bit;
    auto ss = s;
    for(int i=0;i<index.size();i++){
        if(tmp%2){
            change(ss,index[i]);
        }
        tmp/=2;
    }
    if(check(ss)) ans++;
  }

    cout << ans << endl;
}