#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)s; i < (int)e; ++i)
#define all(a) (a).begin(), (a).end()

int main() {
    cin.tie(nullptr);
    
    string S;
    cin >> S;
    
    int siz = S.size();
    vector<int> v;
    rep(i, 0, siz) if (S[i] == 'S') v.push_back(i);
    
    ll ans = 0;
    rep(i, 0, siz - 2) {
        if (S[i] == 'i' && S[i + 1] == 'n' && S[i + 2] == 'g') {
            ans += lower_bound(all(v), i) - v.begin();
        }
    }
    
    cout << ans << '\n';
}