#include<bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) x.begin(),x.end()
#define ll long long

using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

bool my=0;
int cnt=0;
const int N=1e6;
pair<int,int> target;
pair<int,int> last;
string fin="dsa ASD das!";
string manjes="Ds";
string vece="ds";
string nothing="dsa";
string same="dsss";
ll dist(pair<int,int> a,pair<int,int> b){
    return (ll)(a.f-b.f)*(a.f-b.f)+(ll)(a.s-b.s)*(a.s-b.s);
}
string ask(int x,int y){
    cnt++;
    assert(cnt<=64);
    if(my){
        if(target.f==x&&target.s==y){
            printf("solved in %i\n",cnt);
            exit(0);
        }
        if(last.f==-1){
            last={x,y};
            return nothing;
        }
        ll lst=dist(last,target);
        auto lastb=last;
        last={x,y};
        ll nw=dist(last,target);
        if(lst==nw){
            return same;
        }
        if(nw<lst)return manjes;
        return vece;
    }
    printf("%i %i\n",x,y);
    fflush(stdout);
    string xx;
    getline(cin,xx);
    if(xx[sz(xx)-1]=='!'){
        exit(0);
    }
    return xx;
}
void solve(){
    cnt=0;
    if(my){
        //target={rng()%(N+1),rng()%(N+1)};
        target={936003,186752};
        last={-1,-1};
    }
    ask(0,0);
    string manje=ask(1,1);
    string drugi=ask(0,0);
    if(manje==drugi){
        ask(0,1);
        ask(1,0);
    }
    if(my){
        assert(manje==manjes);
    }
    int lx=0,ly=0,rx=N,ry=N;
    while(1){
        int mx=(lx+rx)>>1;
        int my=(ly+ry)>>1;
        string x,y;
        if(lx!=rx){
            ask(mx+1,my);
            x=ask(mx,my);
            if(my)
            assert(x!=same);
        }
        else{
            ask(mx,my);
        }
        if(ly!=ry){
            y=ask(mx,my+1);
            if(my)
            assert(y!=same);
        }
        if(lx!=rx)
        if(x!=manje){
            lx=mx+1;
        }
        else{
            rx=mx;
        }
        if(ly!=ry)
        if(y==manje){
            ly=my+1;
        }
        else{
            ry=my;
        }
    }
}
int main(){
    solve();
}