from bisect import bisect_left, bisect_right

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

ans = []
for i in reversed(range(30)):
    b = bisect_left(A, ((1<<30)-1)-((1<<i)-1))
    if b == 0:
        continue
    L, R = A[:b], A[b:]
    ans.append((1, len(L), 1<<i))
    for j in range(len(L)):
        L[j] += 1<<i
    A = []
    idxL, idxR = 0, 0
    while idxL < len(L) or idxR < len(R):
        if idxR == len(R):
            A.append(L[idxL])
            idxL += 1
        elif idxL == len(L):
            A.append(R[idxR])
            idxR += 1
        else:
            if L[idxL] <= R[idxR]:
                A.append(L[idxL])
                idxL += 1
            else:
                A.append(R[idxR])
                idxR += 1

print(len(ans))
for a in ans:
    print(*a)