#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 100010;

pii interact(int k, int x){
    cout << k << " " << x << endl;
    int t;
    cin >> t;
    assert(t != 1);
    if(t == 0) return {-1, -1};
    cin >> k >> x;
    if(t == 2) return {-1, -1};
    return {k, x};
}

int main(){
    int n;
    cin >> n;
    int k, x;
    if(n % 2 == 0) tie(k, x) = interact(2, n/2);
    else tie(k, x) = interact(1, n/2+1);
    if(k < 0) return 0;
    while(true){
        x = n+1 - x;
        if(k == 2) --x;
        tie(k, x) = interact(k, x);
        if(k < 0) return 0;
    }
}