#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;

    if(n <= 2){
        cout << n << ' ' << 1 << endl;
        fflush(stdout);
        int t; cin >> t;
        return 0;
    }

    if(n % 2 == 1){
        cout << 1 << ' ' << (n+1)/2 << endl;
        fflush(stdout);
        while(true){
            int t;
            cin >> t;
            if(t != 3) break;
            int k, x;
            cin >> k >> x;
            if(x >= (n+1)/2){
                cout << k << ' ' << x - (n+1)/2 << endl;
            }else{
                cout << k << ' ' << x + (n+1)/2 << endl;
            }
            fflush(stdout);
        }
    }else{
        cout << 2 << ' ' << n/2 << endl;
        fflush(stdout);
        while(true){
            int t;
            cin >> t;
            if(t != 3) break;
            int k, x;
            cin >> k >> x;
            if(x >= n/2+1){
                cout << k << ' ' << x - (n/2+1) << endl;
            }else{
                cout << k << ' ' << x + (n/2+1) << endl;
            }
            fflush(stdout);
        }
    }


    return 0;
}