#include <iostream>
#include <math.h>

using namespace std;

int n,k = 0;
double a,b,dist=1,u,cx,cy;
int gasit = 0;

double pairs[50][2];

int overlap(double x, double y, double x2, double y2) {
	if (sqrt((x-x2)*(x-x2) + (y-y2)*(y-y2)) < 2) return 1;
	
	return 0;
}

int in_circle(double x, double y) {
	if (sqrt(x*x+y*y) > n-1) return 0;
	
	return 1;
}

int main() {
	cin>>n;
	cout<<0<<" "<<0<<endl;
	cout.flush();
	
	cx = -n;
	cy = -n;
	
	while (!cin.eof()) {
		cin>>a>>b;
		
		pairs[k][0] = a;		
		pairs[k][1] = b;		
		k++;
		
		gasit = 0;
		while (cx<n) {
			while (cy<n) {
				if (in_circle(cx,cy)) {				
					gasit = 1;
					for (int l=0;l<k;l++) {
						if (overlap(cx,cy,pairs[l][0],pairs[l][1])) gasit = 0;
						if (gasit == 0) break;
					}
					
					if (gasit == 1) break;
				}
				
				cy++;
			}
			
			if (gasit == 1) break;
			cx++; cy = -n;
		}
		
		if (gasit == 0) {
			cout<<"exit"<<endl;
			return 0;
		}
		
		cout<<cx<<" "<<cy<<endl;
		cout.flush();

		pairs[k][0] = cx;		
		pairs[k][1] = cy;		
		k++;
	}
	
	return 0;
}