#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

set<string> st;
void dfs(ll i, string s){
    if(i == 8){
        ll let=0, num=0, syb=0;
        rep(i, 8){
            if('a' <= s[i] && s[i] <= 'z'){
                let++;
            }else if(s[i]=='0' || s[i]=='1'){
                num++;
            }else{
                syb++;
            }
        }

        if(let>=1 && num>=1 && syb>=1) st.insert(s);
        return;
    }else{
        dfs(i+1, s);
        if(s[i]=='l'){
            string t="";
            rep(j, i) t+=s[j];
            t+='1';
            for(ll j=i+1; j<8; j++) t+=s[j];
            dfs(i+1, t);
        }else if(s[i]=='o'){
            string t="";
            rep(j, i) t+=s[j];
            t+='0';
            for(ll j=i+1; j<8; j++) t+=s[j];
            dfs(i+1, t);
        }else if(s[i]=='a'){
            string t="";
            rep(j, i) t+=s[j];
            t+='@';
            for(ll j=i+1; j<8; j++) t+=s[j];
            dfs(i+1, t);
        }else if(s[i]=='s'){
            string t="";
            rep(j, i) t+=s[j];
            t+='$';
            for(ll j=i+1; j<8; j++) t+=s[j];
            dfs(i+1, t);
        }

        return;
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    string s;
    cin >> s;

    dfs(0, s);
    cout << (ll)st.size() << endl;
}