#pragma GCC optimize("Ofast") #include #include #include using namespace std; using namespace __gnu_pbds; using ll = long long; using u64 = uint_fast64_t; using pii = pair; using pll = pair; #define rep(i, n) for(int i = 0; i < (n); ++i) #define all(x) (x).begin(),(x).end() constexpr char ln = '\n'; constexpr long long MOD = 1000000007; //constexpr long long MOD = 998244353; template inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; } template inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; } inline int popcount(int x) {return __builtin_popcount(x);} inline int popcount(long long x) {return __builtin_popcountll(x);} void print() { cout << "\n"; } template void print(const T &x, const Args &... args) { cout << x << " "; print(args...); } /////////////////////////////////////////////////////////////////////////////////////////////////////////////// int main() { //ios::sync_with_stdio(false); cin.tie(nullptr); int N; cin >> N; if (N&1) { cout << "1 " << (N+1)/2 << endl; } else { cout << "2 " << N/2 << endl; } int s = N/2+1; while (true) { int t; cin >> t; if (t <= 1) return 0; int k,x; cin >> k >> x; if (t == 2) return 0; if (x > s) { cout << k << " " << x-s << endl; } else { cout << k << " " << x+s << endl; } } }