九度1006

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
        string ins;
        while(cin>>ins){
                size_t len = ins.size()-1;
                size_t bz = ins.find_first_of("z");
                size_t bj = ins.find_first_of("j");
                
                if(bz==string::npos||bj==string::npos){//没有z,j一定错
                        cout<<"Wrong Answer"<<endl;
                        continue;
                }

                bool flag=true;
                for(int i=bz+1;i<=len;i++){
                        if(ins.at(i)=='z')
                                flag = false;
                }
                for(int i=bj+1;i<=len;i++){
                        if(ins.at(i)=='j')
                                flag = false;
                }
                if(flag==false){        //只能出现一个z,一个j
                        cout<<"Wrong Answer"<<endl;
                        continue;
                }
                if(bj<bz){        //z在j前
                        cout<<"Wrong Answer"<<endl;
                        continue;
                }
                
                
                /*z前o个数为e1,zj之间o个数为e2,j之后o个数为e3*/
                size_t e1 = bz;
                size_t e2 = bj-bz-1;
                if(e2==0){        //z,j之间o的个数至少一个
                        cout<<"Wrong Answer"<<endl;
                        continue;
                }
                size_t e3 = len-bj;
                int x = e2;
                if(e1*x==e3) cout<<"Accepted"<<endl;//实际上题目的三个条件可以得出e1*e2==e3
                else cout<<"Wrong Answer"<<endl;
        }
        return 0;
}