#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define endl '\n'
using namespace std;
using ll=long long;
using db=double;
using pii=pair<int,int>;
const db eps=1e-9;//??
inline int sign(db a){return a<-eps?-1:a>eps;}//?????eps??0
inline int cmp(db a,db b){return sign(a-b);}//a=b??0,a>b??1,a<b??-1
struct P{//??
    db x,y;//??
    P(){}//??????
    P(db _x,db _y):x(_x),y(_y){}//????
    P operator+(P p){return {x+p.x,y+p.y};}//???
    P operator-(P p){return {x-p.x,y-p.y};}//???
    P operator*(db d){return {x*d,y*d};}//??
    P operator/(db d){return {x/d,y/d};}//?????
    bool operator==(P o)const{//?????,??????
        return cmp(x,o.x)==0&&cmp(y,o.y)==0;
    }
    db distTo(P p){return (*this-p).abs();}
    db abs(){return sqrt(abs2());}
    db abs2(){return x*x+y*y;}
    P rot90(){return P(-y,x);}
    P unit(){return *this/abs();}
};
vector<P>isCC(P o1,db r1,P o2,db r2){//???????????
    db d=o1.distTo(o2);
    if(cmp(d,r1+r2)==1)return {};
    if(cmp(d,fabs(r1-r2))==-1)return{};
    d=min(d,r1+r2);
    db y=(r1*r1+d*d-r2*r2)/(2*d),x=sqrt(r1*r1-y*y);
    P dr=(o2-o1).unit();
    P q1=o1+dr*y,q2=dr.rot90()*x;
    return {q1-q2,q1+q2}; 
}
int n;
// vector<P>dbp;
ll query(int x,int y)
{
    cout << x << ' ' << y << endl;
    ll d;
    cin >> d;
    if(!d)n--;
    if(!n)exit(0);
    return d;
    // P cur={(db)x,(db)y};
    // ll res=2e12;
    // for(auto it:dbp)
    //     res=min(res,(ll)(cur.distTo(it)*cur.distTo(it)));
    // cout << x << ' ' << y << ' ' << res << endl;
    // if(!res)
    // {
    //     n--;
    //     dbp.erase(find(dbp.begin(),dbp.end(),P((db)x,(db)y)));
    // }
    // if(!n)exit(0);
    // return res;
}
void solve()
{
    vector<pair<P,db>>rd;
    for(int i=0;i<=1e6;i+=5e5)
        for(int j=0;j<=1e6;j+=5e5)
            if(i!=5e5||j!=5e5)
                rd.pb({{(db)i,(db)j},sqrt(query(i,j))});
    for(int i=0;i<8;i++)
        for(int j=i+1;j<8;j++)
            for(auto [x,y]:isCC(rd[i].fi,rd[i].se,rd[j].fi,rd[j].se))
            {
                if(x<0||x>1e6||y<0||y>1e6)continue;
                ll d=query(x,y);
                if(d<5)
                {
                    for(int dx=-2;dx<=2;dx++)
                        for(int dy=-2;dy<=2;dy++)
                            if(dx||dy)
                            {
                                int nx=x+dx,ny=y+dy;
                                if(nx<0||nx>1e6||ny<0||ny>1e6)continue;
                                query(nx,ny);
                            }
                }
            }
}
int main()
{
    cin >> n;
    // for(int i=0;i<n;i++)
    // {
    //     int x,y;
    //     cin >> x >> y;
    //     dbp.pb({(db)x,(db)y});
    // }
    while(true)
        solve();
    return 0;
}