//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);}
mt19937 rnd(20210448);
int p[105],pos[105];
void sw(int a,int b)
{
	swap(p[pos[a]],p[pos[b]]);
	swap(pos[a],pos[b]);
}
vector<int> solve(vector<int> cur)
{
	if(sz(cur)<=1) return cur;
	int p=rnd()%sz(cur);
	int mnp=inf,mxp=0;
	for(auto x:cur)
	{
		mnp=min(mnp,x);
		mxp=max(mxp,x);
	}
	if(mxp-mnp+1==sz(cur)&&sz(cur)<=50)
	{
		srt(cur);
		p=sz(cur)/2;
	}
	vector<int> v1,v2;
	for(int i=0;i<sz(cur);i++)
		if(i!=p)
		{
			cout<<pos[cur[i]]<<" "<<pos[cur[p]]<<endl;
			int x;
			cin>>x;
			if(x==-1) exit(0);
			if((pos[cur[i]]<pos[cur[p]])^x)
				v1.pb(cur[i]);
			else
				v2.pb(cur[i]);
			if(x) sw(cur[i],cur[p]);
		}
	vector<int> ret=solve(v1);
	ret.pb(cur[p]);
	vector<int> tmp=solve(v2);
	for(auto x:tmp)
		ret.pb(x);
	return ret;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
		p[i]=pos[i]=i;
	vector<int> vec;
	for(int i=1;i<=n;i++)
		vec.pb(i);
	vec=solve(vec);
	for(int i=0;i<n;i++)
		if(pos[vec[i]]!=i+1)
		{
			cout<<i+1<<" "<<pos[vec[i]]<<endl;
			int x;
			cin>>x;
			if(x==-1) exit(0);
			if(x) sw(vec[i],p[i+1]);
		}
	cout<<"-1 -1"<<endl;
	return 0;
}