#include<bits/stdc++.h>
#define ll long long
using namespace std;

const int maxn = 20;

vector<int>V[maxn];
void build()
{
	V[1].push_back(0);
	V[1].push_back(1);
	for(int i=2;i<=10;i++)
	{
		for(int j=0,uj=(int)V[i-1].size();j<uj;j++)
			V[i].push_back( V[i-1][j] );
		for(int uj=(int)V[i-1].size(),j=uj-1;j>=0;j--)
			V[i].push_back( V[i-1][j]|1<<(i-1) );
	}
}
void cov(int l,int r) { cout<<l<<' '<<r<<endl; }
int n;

int main()
{
	ios_base::sync_with_stdio(false);
	
	// 31-__builtin_clz(x);
	
	build();
	
	cin>>n;
	int pos=0,now=0,ini=0;
	int chk=0;
	while(1)
	{
		int k; cin>>k;
		if(k==n) break;
		
		//	int cc=__builtin_clz( V[n-pos][now]^V[n-pos][now-1] );
		
		if(ini)
		{
			cov(1,n);
			ini=0;
			continue;
		}
		
		if(k>=pos+1)
		{
			if( !chk )
			{
				chk=1;
				cov(pos+2,n);
				continue;
			}
			else
			{
				pos++;
				now=0;
				chk=0;
				cov(1,n);
				ini=1;
				continue;
			}
		}
		else
		{
			now++;
			int j= 31-__builtin_clz( V[n-pos][now]^V[n-pos][now-1] );
			cov(pos+1,pos+1+j);
			continue;
		}
	}
	
	return 0;
}