#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937_64 mrand(1234); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

VI gaps{45, 20, 9, 4, 1};
int n,cnt;
int query(int x,int y) {
	printf("%d %d\n",x,y);
	fflush(stdout);
	if (x==-1) return -1;
	scanf("%d",&x);
	return x;
}
int main() {
	scanf("%d",&n);
	for (auto gap:gaps) {
		for (int i=gap;i<=n;i++) {
			int j=i;
			while (j>gap) {
				int w=query(j-gap,j);
				if (w==1) j-=gap;
				if (w==0) break;
				if (w==-1) exit(0);
			}
		}
	}
	query(-1,-1);
}