N = int(input())
A = list(map(int, input().split()))
from bisect import *
l = []
now = 0
for i in reversed(range(30)):
    need = 1<<i
    now += need
    id = bisect_left(A,now)
    for j in range(id):
        A[j] += need
    A.sort()
    l.append((1,id,need))
#print(A)
print(len(l))
for i in l:
    print(*i)