N = int(input())
A = list(map(int, input().split()))
from bisect import *
l = []
for i in range(30):
    id = bisect_left(A,10**9)
    middle = (id+1)//2
    need = 10**9-A[middle-1]
    for j in range(middle):
        A[j] += need
    A.sort()
    l.append((1,id+1,need))
#print(A)
print(len(l))
for i in l:
    print(*i)