#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
typedef long long ll;

int dist;

int judge(int x, int y){
    cout << x << " " << y << endl;
    int t; cin >> t;
    return t;
}

int main(){
    
    dist = judge(0,0);
    if(dist == 0) return 0;
    
    int x_low = 0, x_high = 100000;
    while(x_high - x_low > 1){
        int mid=(x_low + x_high) / 2;
        int dist_t = judge(mid,0);
        if(dist_t == 0) return 0;
        else if(dist_t < dist) {
            x_low = mid;
            dist = dist_t;
        }
        else x_high = mid;
    }
    
    judge(x_low,dist);
    
    return 0;
}