#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
mt19937_64 rng(1);
ll random(ll l,ll r){
    return rng()%(r-l+1)+l;
}
ll myrandom(ll i){
    return rng()%i;
}
ll a[110],b[110];
ll n;
bool ask(ll x,ll y){
    cout<<x<<' '<<y<<endl;
    ll res;
    cin>>res;
    if (res==-1)exit(0);
    if (res)swap(b[x],b[y]);
    return res;
}
bool comp(ll x,ll y){
    assert(x!=y);
    ll id_x,id_y;
    for (ll i = 1;i <= n;i ++){
        if (b[i] == x)id_x=i;
        if (b[i] == y)id_y=i;
    }
    return ask(id_x,id_y) ^ (id_x<id_y);
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
    cin>>n;
    if (n==1)return 0;
    for (ll i = 1;i <= n;i ++){
        a[i] = i;
        b[i] = i;
    }
    stable_sort(a+1,a+1+n,comp);
    for (ll i = 1;i <= n;i ++){
        if (a[i] != b[i]){
            for (ll j = i + 1;j <= n;j ++){
                if (b[j] == a[i]){ask(i,j);break;}
            }
        }
    }
}