#include #define rep(i,n) for(int i=0;i<(int)(n);i++) using namespace std; using ll = long long ; using P = pair ; using pll = pair; constexpr int INF = 1e9; constexpr long long LINF = 1e17; constexpr int MOD = 1000000007; constexpr double PI = 3.14159265358979323846; int main(){ int n; cin >> n; vector a(n,0); if(n%2==0){ cout << 2 << " " << n/2 << endl; cout << flush; a[n/2] = a[n/2+1] = 1; }else{ cout << 1 << " " << n/2 + 1 << endl; cout << flush; a[n/2+1] = 1; } while(1){ int t; cin >> t; if(t==0){ break; }else if(t==3){ int k,x; cin >> k >> x; if(k==1){ a[x-1] = 1; a[n-x] = 1; cout << 1 << " " << n-x+1 << endl; cout << flush; }else{ a[x-1] = a[x] = 1; a[n-x] = a[n-x-1] = 1; cout << 2 << " " << n-x << endl; cout << flush; } } } return 0; }