using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var ans = new List<int[]>();
        for (var i = 29; i >= 0; --i)
        {
            var b = 1 << i;
            if ((a[0] & b) == 0 && (a[^1] & b) != 0)
            {
                var pos = 0;
                while ((a[pos] & b) == 0)
                {
                    a[pos] += b;
                    ++pos;
                }
                ans.Add(new int[] { 1, pos, b });
                Array.Sort(a);
            }
        }
        WriteLine(ans.Count);
        if (ans.Count > 0) WriteLine(string.Join("\n", ans.Select(ai => string.Join(" ", ai))));
    }
    static int LowerBound(int left, int min, IList<int> list)
    {
        if (list[left] >= min) return left;
        var ng = left;
        var ok = list.Count;
        while (ok - ng > 1)
        {
            var center = (ng + ok) / 2;
            if (list[center] < min) ng = center;
            else ok = center;
        }
        return ok;
    }
}