#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void query(const int i, const int k) {
  cout << i + 1 << ' ' << k << endl;
  int ret; cin >> ret;
  if (ret == -1) exit(0);
}

int main() {
  constexpr int B = 16;
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  set<int> stand[B]{};
  REP(i, n) REP(bit, B) {
    if (a[i] >> bit & 1) stand[bit].emplace(i);
  }
  int x = 0;
  REP(i, n) x ^= a[i];
  const auto sub = [&](const int i, const int k) -> void {
    REP(bit, B) {
      if (a[i] >> bit & 1) assert(stand[bit].erase(i) == 1);
    }
    x ^= a[i];
    a[i] -= k;
    x ^= a[i];
    REP(bit, B) {
      if (a[i] >> bit & 1) assert(stand[bit].emplace(i).second);
    }
  };
  const auto judge = [&]() -> void {
    int i, k, ret; cin >> i >> k >> ret; --i;
    if (ret == -1) exit(0);
    sub(i, k);
  };
  if (x == 0) {
    cout << '0' << endl;
    judge();
  } else {
    cout << '1' << endl;
  }
  while (true) {
    assert(x > 0);
    const int msb = 31 - __builtin_clz(x);
    const int i = *stand[msb].begin();
    query(i, a[i] - (a[i] ^ x));
    sub(i, a[i] - (a[i] ^ x));
    judge();
  }
  return 0;
}