K=int(input())
D=list(map(int,input().split()))
D.sort()
node=0
edges=[]
last=0
S=[]
for i in range(K):
    if node==0:
        edges.append((node,node+2,D[i]//2))
        edges.append((node+2,node+1,D[i]//2))
        last=D[i]//2
        S.append(node)
        S.append(node+1)
        node+=2
    else:
        edges.append((node,node+2,D[i]//2-last))
        edges.append((node+2,node+1,D[i]//2))
        S.append(node+1)
        last=D[i]//2
        node+=2
print(node+1)
for a,b,c in edges:
    print(a+1,b+1,c)
print(len(S))
print(*[s+1 for s in S])