#include using namespace std; #define lli long long int #define uli unsigned long long int #define INF 999999999999999999 #define rep(i,m,n) for(lli i = m;i < n;i++) #define rrep(i,m,n) for(lli i=m-1;i>=n;i--) #define pb(n) push_back(n) #define UE(N) N.erase(unique(N.begin(),N.end()),N.end()); #define Sort(n) sort(n.begin(), n.end()) #define Rev(n) reverse(n.begin(),n.end()) #define Out(S) cout << S << endl #define NeOut(S) cout << S #define HpOut(S) cout << setprecision(25) << S << endl #define Vec(K,L,N,S) vector K(N,S) #define DV(K,L,N,M,S) vector> K(N,vector(M,S)) #define TV(K,L,N,M,R,S) vector>> K(N,vector>(M,vector(R,S))) #define pint pair #define paf(L,R) pair #define mod 1000000007 #define MAX 5100000 #define ALL(a) a.begin(),a.end() #define chmax(a, b) a = (((a)<(b)) ? (b) : (a)) #define chmin(a, b) a = (((a)>(b)) ? (b) : (a)) lli gcd(lli num1, lli num2){ return num2 != 0 ? gcd(num2, num1 % num2) : num1; } int main(){ ios::sync_with_stdio(false); cin.tie(0); lli A,B,C,D,E,F,N,M,K,L,X,Y,Z,H,W,sum=0,num=0,flag=0;string S,T; cin >> S; Vec(Q,lli,0,0); Vec(P,lli,0,0); N=S.size(); rep(i,1,N-1)if(S[i-1]=='i'&&S[i]=='n'&&S[i+1]=='g')Q.pb(i-1); rep(i,0,N)if(S[i]=='S')P.pb(i); N=P.size(); M=Q.size(); rep(i,0,N){ if(num>=M)break; if(P[i]