#include <bits/stdc++.h> 
#include <atcoder/all>
#define pub push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (ll i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
using namespace std;
using namespace atcoder;
using ll = long long;
using Pll = pair<ll, ll>;
using mint = modint998244353;
using mint2 = modint1000000007;

constexpr long long INF = (1LL << 60);
constexpr double EPS = 1e-9;
constexpr double PI = 3.141592653589;

template <typename T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
T sq(T x) {
    return x * x;
}

std::string zfill(int n, const int width)
{
    std::stringstream ss;
    ss << std::setw(width) << std::setfill('0') << n;
    return ss.str();
}


int main() {
    string S; cin >> S;
    string T = "10@$";
    string R = "loas";
    ll n = S.size();
    set<string> ss;
    ss.insert(S);
    ll ans = 0;
    rep(i, n) {
        rep(j, 4) {
            if (S[i] == R[j]) {
                for (auto a : ss) {
                    string b = a;
                    b[i] = T[j];
                    ss.insert(b);
                }
            }
        }
    }
    for (auto a : ss) {
        bool ok = false;
        bool ok2 = false;
        bool ok3 = false;
        string s = "0123456789";
        string t = "@$";
        string r = "abcdefghijklmnopqrstuvwxyz";
        rep(i, n) {
            rep(j, 10) {
                if (a[i] == s[j]) {
                    ok = true;
                }
            }
            rep(j, 2) {
                if (a[i] == t[j]) {
                    ok2 = true;
                }
            }
            rep(j, 26) {
                if (a[i] == r[j]) {
                    ok3 = true;
                }
            }
        }
        if (ok && ok2 && ok3) {
            ans++;
        }
    }
    cout << ans << endl;
}