#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e17; const ll dy[9]={0,1,-1,0,1,1,-1,-1,0}; const ll dx[9]={1,0,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } bool issig(char x){ if(isdigit(x))return false; if(islower(x))return false; if(isupper(x))return false; return true; } vector tp={"digi","petit","gema","piyo"}; vector ts={"oyn","uyn","ameg","oyp"}; bool check(string s,ll idx){ rep(i,tp[idx].size())s=s.substr(1); rev(all(s)); ll len=ts[idx].size(); ll cnt=0; rep(i,(ll)s.size()-len+1){ string now=s.substr(i,len); rep(j,len)now[j]=tolower(now[j]); if(now==ts[idx]&&cnt<=3){ return true; } if(issig(s[i]))cnt++; else return false; } return false; } int main(){ string s; while(getline(cin,s)){ bool ok=false; rep(i,4){ if(s.size()