class Player:
    MAX_BIT = 17

    def __init__(self, N: int, A: list):
        self.N = N
        self.A = A
        self.x = self.calc_initial_xor(A)
        self.bits_set = self.calc_initial_bits(A)

    @staticmethod
    def calc_initial_xor(A: list):
        x = 0
        for a in A:
            x ^= a
        return x

    @classmethod
    def calc_initial_bits(cls, A: list):
        st = [set() for _ in range(cls.MAX_BIT)]
        for i, a in enumerate(A):
            for n in range(cls.MAX_BIT):
                if (a >> n) & 1:
                    st[n].add(i)
        return st

    def output(self):
        for n in range(self.MAX_BIT - 1, -1, -1):
            if (self.x >> n) & 1:
                i = self.bits_set[n].pop()
                k = self.A[i] - (self.A[i] ^ self.x)
                self.update(i + 1, k)
                assert self.x == 0
                return i + 1, k

    def update(self, i: int, k: int):
        i -= 1
        self.x ^= self.A[i]
        self.A[i] -= k
        self.x ^= self.A[i]
        for n in range(self.MAX_BIT):
            if i in self.bits_set[n]:
                self.bits_set[n].remove(i)
            if (self.A[i] >> n) & 1:
                self.bits_set[n].add(i)


N = int(input())
A = list(map(int, input().split()))

player = Player(N, A)
t = 0 if player.x == 0 else 1
"""先攻:t=1, 後攻:t=0"""

print(t, flush=True)

while True:
    if t:
        print(*player.output(), flush=True)
    else:
        player.update(*map(int, input().split()))
    ret = int(input())
    if ret != 0:
        exit()
    t = 1 - t