#include <bits/stdc++.h>
using namespace std;
#define db double
#define pb push_back

mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

int rng(int l,int r){return rd()%(r-l+1)+l;}

const int N=1e5+5;
const db eps=1e-6;
int n;

struct vec{
  db x,y;
  vec(db A=0,db B=0){x=A,y=B;}
  vec operator +(const vec &A) const{return vec(x+A.x,y+A.y);}
  vec operator -(const vec &A) const{return vec(x-A.x,y-A.y);}
  vec operator *(const db &k) const{return vec(x*k,y*k);}
  vec operator /(const db &k) const{return vec(x/k,y/k);}
};
struct Line{
  vec a,b;
  Line(vec A=vec(),vec B=vec()){a=A,b=B;}
}q[N];
vector<Line> L;

int dcmp(db x){return x>eps?1:(x<-eps?-1:0);}

db Dot(vec a,vec b){return a.x*b.x+a.y*b.y;}
db Cro(vec a,vec b){return a.x*b.y-a.y*b.x;}
db Len(vec a){return sqrt(Dot(a,a));}

db Atan(vec a){return atan2(a.y,a.x);}

bool cmp(Line A,Line B){
  db t1=Atan(A.b-A.a),t2=Atan(B.b-B.a);
  if(dcmp(t1-t2)!=0) return t1<t2;
  return dcmp(Cro(B.b-A.a,A.b-A.a))>0;
}

bool chk(Line L,vec p){return dcmp(Cro(p-L.a,L.b-L.a))>=0;}

vec Inter(Line L1,Line L2){
  db len1=Cro(L2.a-L1.a,L2.b-L1.a),len2=Cro(L2.a-L1.b,L2.b-L1.b);
  return L1.b+(L1.a-L1.b)*len2/(len2-len1);
}

vector<vec> Halfcut(vector<Line> L){
  sort(L.begin(),L.end(),cmp);
  int h=1,t=0;
  vector<Line> cur;swap(L,cur);
  for(int i=0;i<(int)cur.size();i++)
    if(!i||dcmp(Atan(cur[i].b-cur[i].a)-Atan(cur[i-1].b-cur[i-1].a))!=0) L.pb(cur[i]);
 
  for(auto i:L){
    while(h<t&&chk(i,Inter(q[t],q[t-1]))) --t;
    while(h<t&&chk(i,Inter(q[h],q[h+1]))) ++h;
    q[++t]=i;
  }
  while(h<t&&chk(q[h],Inter(q[t],q[t-1]))) --t;
  while(h<t&&chk(q[t],Inter(q[h],q[h+1]))) ++h;
  
  vector<vec> res;
  if(h<t) for(int i=h;i<=t;i++) res.pb(Inter(q[i],q[i==t?h:(i+1)]));
  return res;
}

db Sum(vector<vec> p){
  db res=0;
  for(int i=0;i<(int)p.size();i++) res+=Cro(p[i],p[(i+1)%(int)p.size()]);
  return res/2.0;
}

Line Ask(int x,int y){
  cout<<x<<' '<<y<<'\n',cout.flush();
  int qx,qy;cin>>qx>>qy;
  if(x==qx&&y==qy) exit(0);
  
  vec O=vec(qx,qy)-vec(x,y);
  return Line(vec(x,y),vec(x,y)+vec(O.y,-O.x));
}

int main(){
  cin>>n;
  L.pb(Line(vec(0.5,0.5),vec(n+0.5,0.5)));
  L.pb(Line(vec(n+0.5,0.5),vec(n+0.5,n+0.5)));
  L.pb(Line(vec(n+0.5,n+0.5),vec(0.5,n+0.5)));
  L.pb(Line(vec(0.5,n+0.5),vec(0.5,0.5)));
  
  while(1){
    vector<vec> p=Halfcut(L);
    vec sq=vec();
    for(vec i:p) sq=sq+i;
    sq=sq/(int)p.size();
    int x=(int)sq.x+rng(0,1),y=(int)sq.y+rng(0,1);
    x=min(max(x,1),n),y=min(max(y,1),n);
    L.pb(Ask(x,y));
  }
  return 0;
}