#include<bits/stdc++.h>
using namespace std;

int posx=12345,posy=0;
long long lastdist=0;
const bool debug = false;
const string UGUALE = "uguakjhgkjhle", VICINO = "vickjhgkjhgino", LONTANO = "lonkjhgkjhgtano";

void solve(int t){
    const int n = 1'000'000;
    
    auto query = [](int x,int y)->string{
        cout<<x<<" "<<y<<endl;
        
        string s;
        
        if(!debug){
            getline(cin,s);
        }else{
            long long dist = 1ll*(posx-x)*(posx-x)+1ll*(posy-y)*(posy-y);
            if(dist==lastdist){
                s = UGUALE;
            }else if(dist<lastdist){
                s = VICINO;
            }else{
                s = LONTANO;
            }
            cout<<s<<"\n";
            lastdist=dist;
            if(dist==0){
                cout<<"ok\n";
                exit(0);
            }
        }
        
        if(s.back()=='!')exit(0);
        return s;
    };
    
    map<string,int> val;
    
    query(0,0);
    string tmp1 = query(1,0);
    string tmp3 = query(0,0);
    string tmp2 = query(0,1);
    
    if(tmp1==tmp2){
        val[tmp2]=1;
        val[tmp3]=-1;
    }else{
        query(n,0);
        tmp3 = query(n-1,0);
        val[tmp3]=1;
        val[(tmp1!=tmp3 ? tmp1 : tmp2)]=-1;
    }
    
    int lx=0,rx=n+1,ly=0,ry=n+1;
    
    if(debug){
        cout<<"valori:\n";
        for(auto [x,y] : val){
            cout<<x<<" "<<y<<"\n";
        }
        cout<<"parto\n";
    }
    
    while(rx-lx>1 || ry-ly>1){
        
        if(debug)cout<<"----------\n";
        query(lx,ly);
        string tmp1 = query(rx-1,ly);
        string tmp2 = query(rx-1,ry-1);
        
        int midx = (lx+rx)/2;
        int midy = (ly+ry)/2;
        
        if(val[tmp1]>=0){
            lx=midx;
        }else{
            rx=midx;
        }
        
        if(val[tmp2]>=0){
            ly=midy;
        }else{
            ry=midy;
        }
    }
    
    query(lx,ly);
}

int main(){
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}