#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    string s;
    cin >> s;
    ll a = 0, ans = 0;
    for (int i = 0; i < s.size(); ++i) {
        if(i >= 2 && s[i-2] == 'i' && s[i-1] == 'n' && s[i] == 'g') ans += a;
        if(s[i] == 'S') a++;
    }
    cout << ans << "\n";
    return 0;
}