#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T>
bool chmax(T& a, const T& b)
{
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b)
{
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 2E+05;
struct edge {
    int to, cost, id;
};

ll di[4] = { 0, -1, 0, 1 }, dj[4] = { 1, 0, -1, 0 };

string S;
map<char, char> mp = { { 'l', '1' }, { 'o', '0' }, { 'a', '@' }, { 's', '$' } };

bool check(string& s)
{
    int c0 = 0, c1 = 0, c2 = 0;
    for (char c : s) {
        if (isdigit(c)) {
            c0++;
        } else if (islower(c)) {
            c1++;
        } else if (c == '@' || c == '$') {
            c2++;
        }
    }
    return c0 > 0 && c1 > 0 && c2 > 0;
}

void dfs(string& t, ll& ans)
{
    if (t.size() == S.size()) {
        if (check(t))
            ans++;
        return;
    }
    if (mp.count(S[t.size()]) > 0) {
        t += mp[S[t.size()]];
        dfs(t, ans);
        t.pop_back();
    }
    t += S[t.size()];
    dfs(t, ans);
    t.pop_back();
}

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

    cin >> S;

    string t;
    ll ans = 0;
    dfs(t, ans);

    cout << ans << "\n";

    return 0;
}