#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i=0;i < (int)(n);i++)

string s;
int digit = 0;
int az = 0;
int sym = 0;
int n;
int ans = 0;
void dfs(int idx){
  //cout << "index:" << idx << endl;
  if (idx == n){
    //cout << digit << " " << az << endl;
    if (digit > 0 && az > 0 && sym > 0){
      ans++;
    }
    return;
  }
  
  if (s[idx] == 'l' || s[idx] == 'o'){
    az++;
    dfs(idx+1);
    az--;
    digit++;
    dfs(idx+1);
    digit--;
  }
  else if (s[idx] == 'a' || s[idx] == 's'){
    az++;
    dfs(idx+1);
    az--;
    sym++;
    dfs(idx+1);
    sym--;
  }
  else{
    az++;
    dfs(idx+1);
    az--;
  }
  return;
}

void solve(){
  cin >> s;
  n = s.size();
  //cout << n << endl;
  dfs(0);
  cout << ans << endl;
  
}

  

int main(){
  int tt = 1;
  //cin >> tt;
  while(tt--){
	  solve();
  }
  return 0;
}