// 

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ll = long long;

#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) (x).begin(), (x).end()

const int INF = (int)(1e9);
const int BLEN = 17;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n;
	scanf("%d", &n);
	vector<int> a(n);
	rep(i, n) scanf("%d", &a[i]);
	vector<unordered_set<int>> bids(BLEN);
	rep(i, n) rep(j, BLEN) if (a[i]&(1<<j)) bids[j].insert(i);
	int xval = accumulate(all(a), 0, bit_xor<int>()), ti = (xval != 0) ? 1 : 0;
	printf("%d\n", ti);
	fflush(stdout);
	int ret = 0;
	if (ti == 1) {
		int bi = 31 - __builtin_clz(xval), id = *bids[bi].begin(), ki = a[id] - (a[id]^xval);
		rep(i, BLEN) if (xval&(1<<i)) {
			if (bids[i].find(id) != bids[i].end()) bids[i].erase(id);
			else bids[i].insert(id);
		}
		a[id] ^= xval;
		printf("%d %d\n", id+1, ki);
		fflush(stdout);
		scanf("%d", &ret);
	}
	while (ret != -1) {
		int id2, ki2;
		scanf("%d%d", &id2, &ki2);
		--id2;
		int sval = a[id2] ^ (a[id2]-ki2);
		rep(i, BLEN) if (sval&(1<<i)) {
			if (bids[i].find(id2) != bids[i].end()) bids[i].erase(id2);
			else bids[i].insert(id2);
		}
		a[id2] -= ki2;
		xval = accumulate(all(a), 0, bit_xor<int>());
		scanf("%d", &ret);
		if (ret == -1) break;
		int bi = 31 - __builtin_clz(xval), id = *bids[bi].begin(), ki = a[id] - (a[id]^xval);
		rep(i, BLEN) if (xval&(1<<i)) {
			if (bids[i].find(id) != bids[i].end()) bids[i].erase(id);
			else bids[i].insert(id);
		}
		a[id] ^= xval;
		printf("%d %d\n", id+1, ki);
		fflush(stdout);
		scanf("%d", &ret);
	}
	return 0;
}