#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define rrep(i, r, l) for (int i = (int)(r); i > (int)(l); i--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

void solve() {
    const int n = 8;
    string s;
    cin >> s;
    
    int num = 0;
    int syn = 0;
    rep(i, 0, n) {
        if (s[i] == 'l' || s[i] == 'o') {
            num++;
        } else if (s[i] == 'a' || s[i] == 's') {
            syn++;
        }
    }

    int ans = ((1 << num) - 1)  * ((1 << syn) - 1);
    if (num + syn == n && num != 0 && syn != 0) {
        ans--;
    }
    cout << ans << endl;
}

int main() {
    int q = 1;
    // cin >> q;
    while (q--) {
        solve();
    }
}