#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> t3;

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

int mid(int l, int r)
{
    return (l + r)/2;
}

int main(){
    int lx = 0;
    int rx = 100000;
    int ld = process(lx, 0);
    int rd = process(rx, 0);
    
    while(rx - lx > 1)
    {
        if(ld < rd)
        {
            rx = mid(lx, rx);
            rd = process(rx, 0);
        }
        else
        {
            lx = mid(lx, rx);
            ld = process(lx, 0);
        }
    }
    if(ld < rd)
    {
        process(lx, ld);
    }
    else
    {
        process(rx, rd);
    }
    return 0;
}