#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
#include <tuple>
#include <ranges>
namespace ranges = std::ranges;
namespace views = std::views;
// #include "Src/Number/IntegerDivision.hpp"
// #include "Src/Utility/BinarySearch.hpp"
// #include "Src/Sequence/CompressedSequence.hpp"
// #include "Src/Sequence/RunLengthEncoding.hpp"
// #include "Src/Algebra/Group/AdditiveGroup.hpp"
// #include "Src/DataStructure/FenwickTree/FenwickTree.hpp"
// #include "Src/DataStructure/SegmentTree/SegmentTree.hpp"
// #include "Src/DataStructure/DisjointSetUnion/DisjointSetUnion.hpp"
// using namespace zawa;
// #include "atcoder/modint"
// using mint = atcoder::modint998244353;
int N, A[200020];
int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cin >> N;
    for (int i = 0 ; i < N ; i++) std::cin >> A[i];
    std::vector<std::tuple<int, int, int>> ans;
    for (int i = 29 ; i >= 0 ; i--) {
        int j = 0;
        while (j < N and (A[j] & (1 << i)) == 0) j++;
        if (j == 0) continue;
        ans.push_back({0, j, (1 << i)});
        for (int k = 0 ; k < j ; k++) A[k] += (1 << i);
        ranges::sort(A, A + N);
    }
    for (int i = 0 ; i < N ; i++) assert(A[i] == A[0]);
    std::cout << ans.size() << std::endl;
    for (auto [l, r, v] : ans) std::cout << l + 1 << ' ' << r << ' ' << v << '\n';
}