#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
#endif
typedef long long  ll;
typedef pair<int,int> pii; typedef pair<ll,ll> pll;
const int INF = 1e9; const long long LINF = 1e18;
const int MOD = 998244353; const int MOD1 = 1e9+7;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(x) x.begin(), x.end()
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
void yorn(bool ans){cout << (ans?"Yes":"No") << endl; return;}

// しばらくはsize_tをキャストに任せてみようかな
int main(){
    string s; cin >> s;
    vector<int> a(4,0);
    rep(i,8){
        if(s.at(i)=='l') a.at(0)++;
        else if(s.at(i)=='o') a.at(1)++;
        else if(s.at(i)=='a') a.at(2)++;
        else if(s.at(i)=='s') a.at(3)++;
    }
    if(s.at(0)==0&&s.at(1)==0){cout << 0 << endl; return 0;}
    if(s.at(2)==0&&s.at(3)==0){cout << 0 << endl; return 0;}
    if(a.at(0)+a.at(1)+a.at(2)+a.at(3)<8){
        cout << (pow(2,a.at(0))*pow(2,a.at(1))-1)*(pow(2,a.at(2))*pow(2,a.at(3))-1) << endl;
        return 0;
    }
    else{
        //cout << s.at(0)+s.at(1)+s.at(2)+s.at(3) << endl;
        cout << (pow(2,a.at(0))*pow(2,a.at(1))-1)*(pow(2,a.at(2))*pow(2,a.at(3))-1)-1 << endl;
        return 0;
    }
}