//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define db double
const int maxn=1e5+5;
const db eps=1e-6;
struct pt{db x,y;}p[maxn];
pt operator -(pt A,pt B){return {A.x-B.x,A.y-B.y};}
pt operator +(pt A,pt B){return {A.x+B.x,A.y+B.y};}
db operator *(pt A,pt B){return A.x*B.x+A.y*B.y;}
db operator ^(pt A,pt B){return A.x*B.y-A.y*B.x;}
pt operator *(db a,pt B){return {a*B.x,a*B.y};}
db atan2(pt A){return atan2(A.y,A.x);}
int dcmp(db x){return (x>eps)-(x<-eps);}
db len(pt A){return sqrt(A.x*A.x+A.y*A.y);}
db dis(pt A,pt B){return len(B-A);}
struct line{pt p,q;}L[maxn];
pt itsect(line A,line B){
	pt u=A.p-B.p;
	db t=(B.q^u)/(A.q^B.q);
	return A.p+t*A.q;
}
int q[maxn],ql,qr,n,cnt=0;
#define Poly vector<pt>
bool operator <(line A,line B){
	db sa=atan2(A.q),sb=atan2(B.q);
	if(dcmp(sa-sb)!=0)return sa<sb;
	return (A.q^(B.p-A.p))>0;
}
db calcS(Poly P){
	db S=0;for(int i=1;i+1<P.size();i++)S+=(P[i]-P[0])^(P[i+1]-P[0]);
	return S/2.0;
}
Poly Half_itsect(){
	sort(L+1,L+n+1);
	ql=1,qr=0;
	for(int i=1;i<=n;i++){
		while(qr>ql&&((itsect(L[q[qr]],L[q[qr-1]])-L[i].p)^L[i].q)>0)--qr;
		while(qr>ql&&((itsect(L[q[ql]],L[q[ql+1]])-L[i].p)^L[i].q)>0)++ql;
		if(qr>=ql&&dcmp(atan2(L[i].q)-atan2(L[q[qr]].q))==0)--qr;
		q[++qr]=i;
	}
	while(qr>ql&&((itsect(L[q[qr]],L[q[qr-1]])-L[q[ql]].p)^L[q[ql]].q)>0)--qr;
	q[qr+1]=q[ql],++qr;Poly P;
	for(int j=ql;j<qr;j++)P.push_back(itsect(L[q[j]],L[q[j+1]]));
	return P;
}
pair<pt,Poly> getcent(vector<line> vec){
	n=sz(vec);
	for(int i=1;i<=n;i++)
	{
		L[i]=vec[i-1];
		L[i].q=L[i].q-L[i].p;
	}
	Poly res=Half_itsect();
	db S=calcS(res)*6;
	pt Ans={0,0};
	for(int i=1;i+1<res.size();i++)
		Ans=Ans+((res[i]-res[0])^(res[i+1]-res[0]))*(res[0]+res[i]+res[i+1]);
	return mp((1.0/S)*Ans,res);
}
int _kround(db x)
{
	int a=floor(x);
	if((a+1-x)<(x-a)) return a+1;
	return a;
}
pair<int,int> reshape(Poly P,int x,int y)
{
	for(int d=0;;d++)
		for(int a=-d;a<=d;a++)
			for(int b=-d;b<=d;b++)
				if(abs(a)+abs(b)<=d)
				{
					int flag=1;
					for(int i=0;i<P.size();i++)
					{
						int j=(i+1)%P.size();
						if(((pt{x-P[i].x,y-P[i].y})^(P[j]-P[i]))>eps)
						{
							flag=0;
							break;
						}
					}
					if(flag) return mp(x,y);
				}
}
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int d;
	cin>>d;
	if(d==1)
	{
		cout<<"1 1"<<endl;
		return 0;
	}
	vector<line> vec;
	vec.push_back(line{{1,1},{(db)d,1}});
	vec.push_back(line{{(db)d,1},{(db)d,(db)d}});
	vec.push_back(line{{(db)d,(db)d},{1,(db)d}});
	vec.push_back(line{{1,(db)d},{1,1}});
	for(int i=0;i<90;i++)
	{
		auto pr=getcent(vec);
		pt p=pr.first;
		int x=_kround(p.x);
		int y=_kround(p.y);
		auto ppr=reshape(pr.second,x,y);
		x=ppr.first;
		y=ppr.second;
		cout<<x<<" "<<y<<endl;
		int x2,y2;
		cin>>x2>>y2;
		if(x==x2&&y==y2) return 0;
		x2-=x;
		y2-=y;
		db x3=x2,y3=y2;
		db len=sqrt(x3*x3+y3*y3);
		x3/=len;
		y3/=len;
		vec.push_back(line{{(db)x-y2+eps*x3,(db)y+x2+eps*y3},{(db)x+y2+eps*x3,(db)y-x2+eps*y3}});
	}
	return 0;
}