#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int main(){
    string S; cin >> S;
    string T = "loas";
    int ans[2] = {1,1};
    int t = 1;
    for(char c : S) if(T.find(c) != string::npos) ans[T.find(c)/2] *= 2; else t = 0;
    cout << max(0,(ans[0]-1)*(ans[1]-1)-t) << endl;
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;