#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
using db=long double;
const db eps=1e-8;
int sgn(db x)
{
	if(x<-eps) return -1;
	else if(x>eps) return 1;
	else return 0;
}
struct Vec
{
	db x,y;
	Vec(db a=0,db b=0) {x=a,y=b;}
	db norm() {return x*x+y*y;}
	db abs() {return sqrt(x*x+y*y);}
};
Vec operator + (const Vec &x,const Vec &y) {return Vec(x.x+y.x,x.y+y.y);}
Vec operator - (const Vec &x,const Vec &y) {return Vec(x.x-y.x,x.y-y.y);}
Vec operator * (const Vec &x,const db y) {return Vec(x.x*y,x.y*y);}
Vec operator / (const Vec &x,const db y) {return Vec(x.x/y,x.y/y);}
db dis(const Vec &x,const Vec &y) {return (x-y).abs();}
db dis(const Vec &x) {return sqrt(x.x*x.x+x.y*x.y);}
void print(Vec x) {printf("%.10Lf %.10Lf\n",x.x,x.y);}
db cdot(const Vec &x,const Vec &y) {return x.x*y.x+x.y*y.y;}
db cross(const Vec &x,const Vec &y) {return x.x*y.y-x.y*y.x;}
int ccw(const Vec &x,const Vec &y,const Vec &z)
{
	int w=sgn(cross(y-x,z-x));
	if(w==1) return 1; // ccw
	else if(w==-1) return -1; // cw;
	else return 0; // coline
}
struct Seg
{
	Vec s,t; // two points
	Seg(Vec x,Vec y) {s=x,t=y;}
	Seg() {}
	Vec d() {return t-s;}
	Vec point(db p) {return s+(t-s)*p;}
};
int parallel(Seg p,Seg q) {return sgn(cross(p.d(),q.d()))==0;}
Vec proj(Seg l,Vec x)
{
	db p=cdot(l.t-l.s,x-l.s)/(l.t-l.s).norm();
	return l.point(p);
}
int isintersect(Seg p,Seg q)
{
	if(max(p.s.x,p.t.x)<min(q.s.x,q.t.x)) return 0;
	if(max(q.s.x,q.t.x)<min(p.s.x,p.t.x)) return 0;
	if(max(p.s.y,p.t.y)<min(q.s.y,q.t.y)) return 0;
	if(max(q.s.y,q.t.y)<min(p.s.y,p.t.y)) return 0;
	if(ccw(q.s,p.s,p.t)*ccw(q.t,p.s,p.t)==1) return 0;
	if(ccw(p.s,q.s,q.t)*ccw(p.t,q.s,q.t)==1) return 0;
	return 1;
}
Vec crosspoint(Seg p,Seg q)
{
	db A=cross(p.t-p.s,q.t-q.s);
	db B=cross(p.t-p.s,p.t-q.s);
	return q.s+(q.t-q.s)*(B/A);
}
Vec r90(Vec x) {return Vec(-x.y,x.x);}
// counter-clockwise halfplanes
// return counter-clockwise
vector<Vec> halfPlane(vector<Seg> v)
{
	sort(v.begin(),v.end(),[&](Seg x,Seg y){
		db ang1=atan2(x.d().y,x.d().x);
		db ang2=atan2(y.d().y,y.d().x);
		if(sgn(ang1-ang2)) return ang1<ang2;
		else return ccw(x.s,y.s,y.t)==1;
	});
	auto onRight=[&](Seg s,Vec x) {return ccw(s.s,x,s.t)>=0;};
	static Seg q[1005];
	static Vec p[1005];
	int l=0,r=0; q[0]=v[0];
	for(int i=1;i<(int)v.size();i++)
	{
		while(l<r&&onRight(v[i],p[r])) r--;
		while(l<r&&onRight(v[i],p[l+1])) l++;
		q[++r]=v[i];
		if(parallel(q[r],q[r-1]))
		{
			if(onRight(q[r],q[r-1].s)&&cdot(q[r].d(),q[r-1].d())<eps) return {};
			r--;
			if(!onRight(q[r],v[i].s)) q[r]=v[i];
		}
		if(l<r) p[r]=crosspoint(q[r],q[r-1]);
	}
	while(l<r&&onRight(q[l],p[r])) r--;
	if(r-l<=1) return {};
	p[l]=crosspoint(q[l],q[r]);
	return vector<Vec>(p+l,p+r+1);
}
const int L=90;
int N,keyx,keyy;
int cnt=0;
vector<Seg> a;
Vec query(int x,int y)
{
	printf("%d %d\n",x,y); fflush(stdout);
	cnt++;
#ifdef wasa855
	printf("**** %d\n",cnt);
	if(x==keyx&&y==keyy) exit(0);
	return Vec(keyx,keyy);
#endif
	int a=read(),b=read();
	if(a==x&&b==y) exit(0);
	return Vec(a,b);
}
db Area(vector<Vec> v) // ccw
{
	db ans=0;
	for(int i=1;i+1<(int)v.size();i++) ans+=cross(v[i]-v[0],v[i+1]-v[0]);
	return ans/2;
}
Vec centroid(Vec A, Vec B, Vec C)
{
	return (A+B+C)/3;
}
vector<Vec> chkok(vector<Vec> hull,int lim)
{
	db S=Area(hull);
	if(S>lim) return {};
	int L=N,R=0,U=0,D=N;
	for(auto [x,y]:hull) L=min(L,(int)floor(x)),R=max(R,(int)ceil(x)),U=max(U,(int)ceil(y)),D=min(D,(int)floor(y));
	vector<Vec> ans;
	for(int i=L;i<=R;i++) for(int j=D;j<=U;j++)
	{
		Vec v(i,j);
		int ok=1;
		for(auto seg:a) ok&=ccw(seg.s,seg.t,v)==1;
		if(ok) ans.push_back(v);
	}
	if((int)ans.size()<=lim) return ans;
	else return {};
}
signed main()
{
	N=read();
#ifdef wasa855
	cin>>keyx>>keyy;
#endif
	a.emplace_back(Vec(0,0),Vec(N+1,0));
	a.emplace_back(Vec(N+1,0),Vec(N+1,N+1));
	a.emplace_back(Vec(N+1,N+1),Vec(0,N+1));
	a.emplace_back(Vec(0,N+1),Vec(0,0));
	for(int i=1;i<=L;i++)
	{
		vector<Vec> hull=halfPlane(a);
		vector<Vec> vok=chkok(hull,L-i);
		// printf("%Lf\n",Area(hull));
		// for(auto i:hull) print(i);
		// printf("----------------------\n");
		if(vok.empty())
		{
			Vec c(0,0); db siz=0;
			for(int j=1;j+1<(int)hull.size();j++)
			{
				db s=cross(hull[j]-hull[0],hull[j+1]-hull[0]);
				// printf("%Lf\n",s);
				c=c+centroid(hull[0],hull[j],hull[j+1])*s;
				siz+=s;
			}
			c=c/siz;
			int X=round(c.x),Y=round(c.y);
			// printf("+++ %Lf %d %Lf %d\n",c.x,X,c.y,Y);
			Vec R(X,Y); Vec Q=query(X,Y);
			Vec d=r90(Q-R);
			Seg s(R+d,R-d);
			a.push_back(s);
		}
		else
		{
			shuffle(vok.begin(),vok.end(),rnd);
			for(auto [x,y]:vok)
			{
				query(x,y);
			}
		}
	}
	return 0;
}