/* -*- coding: utf-8 -*-
 *
 * 2165.cc:  No.2165 Let's Play Nim! - yukicoder
 */

#include<cstdio>
#include<set>
#include<algorithm>
#include<utility>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 75000;

enum { First = 1, Second = 0 };

/* typedef */

typedef pair<int,int> pii;
typedef set<pii,greater<pii> > spiig;

/* global variables */

int as[MAX_N];

/* subroutines */

int my_act(spiig &ps, int x) {
  pii e = *ps.begin();
  int ai = e.first, i = e.second;
  int k = ai - (x ^ ai);

  ps.erase(ps.begin());
  if (ai > k) ps.insert(pii(ai - k, i));
  as[i] -= k;

  printf("%d %d\n", i + 1, k); fflush(stdout);
  int r;
  scanf("%d", &r);
  return r;
}

int judge_act(spiig &ps) {
  int i, k, r;
  scanf("%d%d%d", &i, &k, &r), i--;

  spiig::iterator sit = ps.find(pii(as[i], i));
  int ai = sit->first;

  ps.erase(sit);
  if (ai > k) ps.insert(pii(ai - k, i));
  as[i] -= k;

  return (r < 0) ? -1 : ai ^ as[i];
}

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  int x = 0;
  spiig ps;
  for (int i = 0; i < n; i++) {
    x ^= as[i];
    ps.insert(pii(as[i], i));
  }

  if (x != 0) {
    printf("%d\n", First); fflush(stdout);
    my_act(ps, x);
  }
  else
    printf("%d\n", Second); fflush(stdout);

  for (;;) {
    int x = judge_act(ps);
    if (x < 0) break;

    int r = my_act(ps, x);
    if (r < 0) break;
  }

  return 0;
}