#include<bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<tuple<int, int, int>> res;
    for (int i = 29; i >= 0; i--) {
        if (((a[0] ^ a[n-1]) >> i) & 1) {
            int ok = 0, ng = n - 1;
            while (abs(ok - ng) > 1) {
                int mid = (ok + ng) / 2;
                if (!((a[mid] >> i) & 1)) ok = mid;
                else ng = mid;
            }
            res.push_back({0, ok, (1<<i)});
            for (int j = 0; j <= ok; j++) a[j] += (1<<i);
            sort(a.begin(), a.end());
        }
    }
    cout << res.size() << endl;
    for (auto [l, r, v] : res) cout << l << " " << r << " " << v << endl;
}