#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int query(int x, int y) {
	printf("%d %d\n", x, y);
	fflush(stdout);
	int res;
	scanf("%d", &res);
	return res;
}

int main() {
	int l = -1, r = 100000;
	while (r - l > 1) {
		int m = (r + l) / 2;
		
		int x1 = m + 1;
		int y1 = query(x1, INF);
		
		int x2 = m;
		int y2 = query(x2, INF);
		
		if (y1 > y2) r = m;
		else l = m;
	}
	
	int x = r;
	
	l = -1;
	r = 100000;
	while (r - l > 1) {
		int m = (r + l) / 2;
		
		int x1 = m + 1;
		int y1 = query(INF, x1);
		
		int x2 = m;
		int y2 = query(INF, x2);
		
		if (y1 > y2) r = m;
		else l = m;
	}
	
	int y = r;
	
	FOR(i, -1, 2) {
		FOR(j, -1, 2) {
			int now = query(x + i, y + j);
			if (now == 0) return 0;
		}
	}
	return 0;
}