#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { string s; ll ans = 0; ll cnt = 0; int n = s.size(); drep(i,n-2){ if(s[i]=='i'&&s[i+1]=='n'&&s[i+2]=='g') cnt++; if(s[i]=='S') ans += cnt; } cout << ans << endl; return 0; }