Hack for https://codeforces.com/contest/1930/submission/246909255

padding_bits = 7

class Solver:
    def __init__(self) -> None:
        self.arr: list[int] = []
        self.ans = 0

    def add(self, val: int):
        self.arr.append(val)
        for i in range(len(self.arr) - 1):
            self.ans = max(self.ans, self.arr[i] & ~val)
            self.ans = max(self.ans, val & ~self.arr[i])

def slow_solve(arr: list[int]) -> int:
    ans = 0
    for i in arr:
        for j in arr:
            ans = max(ans, i & ~j)
    return ans

def gen_seq() -> list[int]:
    seq: list[int] = []

    r = 1 << padding_bits
    seq.append((r << 3) + 1)
    for i in range(1, r):
        seq.append(i * 2 + 1)

    seq.append(0)

    return seq

seq = gen_seq()
n = 1 << (padding_bits + 4)
q = len(seq)

queries: list[int] = []
solver = Solver()
for i in range(len(seq)):
    queries.append((seq[i] - solver.ans) % n)
    solver.add(seq[i])

print(1)
print(n, q)
print(*queries)