from bisect import bisect_left
n = int(input())
a = list(map(int, input().split()))
ans = []
for k in range(30)[::-1]:
    p = bisect_left(a, (1 << 30) - (1 << k))
    if p:
        ans.append((p, 1 << k))
        for i in range(p):
            a[i] += 1 << k
        a.sort()
print(len(ans))
for p, v in ans:
    print(1, p, v)