// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
std::mt19937_64 Rand(std::chrono::system_clock::now().time_since_epoch().count());
int n, a[105], cnt;
bool op(int x, int y)
{
    if (x > y)
        std::swap(x, y);
    std::cout << x << ' ' << y << std::endl;
    static int res;
    // ++cnt;
    // res = a[x] > a[y];
    // if (res)
    //     std::swap(a[x], a[y]);
    // std::cout << res << std::endl;
    std::cin >> res;
    if (res == -1)
        exit(0);
    return res;
}
void sort(int l, int r)
{
    if (r < l)
        return;
    int cur = Rand() % (r - l + 1) + l;
    int li = l, ri = r;
    while (li <= ri)
        if (li < cur)
            op(li, cur) ? cur = li++ : li++;
        else if (ri > cur)
            op(ri, cur) ? cur = ri-- : ri--;
        else
            break;
    sort(l, cur - 1);
    sort(cur + 1, r);
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n;
    // for (int i = 1; i <= n; ++i)
    //     std::cin >> a[i];
    sort(1, n);
    // for (int i = 1; i <= n; ++i)
    //     std::cout << a[i] << " \n"[i == n];
    std::cout << -1 << ' ' << -1 << std::endl;
    // std::cout << cnt << std::endl;
    return 0;
}