#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  string s; cin >> s;
  const int n = s.length();
  set<string> st;
  REP(bit, 1 << n) {
    string t = s;
    REP(i, n) {
      if (bit >> i & 1) {
        switch (s[i]) {
          case 'l':
          case 'o':
            t[i] = '1';
            break;
          case 'a':
          case 's':
            t[i] = '@';
            break;
          default:
            break;
        }
      }
    }
    if (count(ALL(t), '1') > 0 && count(ALL(t), '@') > 0 && count(ALL(t), '1') + count(ALL(t), '@') < n) st.emplace(t);
  }
  cout << st.size() << '\n';
  return 0;
}