import sys
from bisect import bisect_left

def solve():
    try:
        N_line = sys.stdin.readline()
        if not N_line:
            return
        N = int(N_line.strip())
        
        A_line = sys.stdin.readline()
        if not A_line:
            return
        A = list(map(int, A_line.strip().split()))

    except (IOError, ValueError) as e:
        return

    operations = []
    target_prefix = 0

    for k in range(29, -1, -1):
        v = 1 << k  # v = 2^k

        i = bisect_left(A, target_prefix + v)

        if 0 < i < N:
            operations.append((1, i, v))

            for j in range(i):
                A[j] += v
            A.sort()

        if bisect_left(A, target_prefix + v) == 0:
            target_prefix += v

    print(len(operations))
    for op in operations:
        print(*op)

if __name__ == "__main__":
    solve()