N = int(input())
A = list(map(int,input().split()))
ans = []
amax = A[-1]
while A[0]<amax:
    dmax = A[1]
    v = amax-A[0]
    ind = 0
    for i in range(1,N):
        if A[i]==amax:break
        d = amax-A[i]
        l = min(A[0]+d,A[i+1])
        if l>dmax:
            dmax = l
            ind = i
    ans.append((0,ind,amax-A[ind]))
    for i in range(ind+1):
        A[i] += amax-A[ind]
    A = sorted(A)
print(len(ans))
for l,r,v in ans:
    print(l,r,v)