#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

const int INFI=numeric_limits<int>::max()/2;
const ll INFL=numeric_limits<ll>::max()/2;

#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin>>n;
    vi a(n);
    rep(i,0,n){
        cin>>a[i];
    }
    vector<tuple<int,int,int>> ans;
    rrep(i,29,0){
        int r=-1;
        rep(j,0,n){
            if(!((a[j]>>i)&1)){
                r=j;
            }
        }
        if(r==-1)continue;
        ans.emplace_back(1,r+1,(1<<i));
        rep(j,0,r+1){
            a[j]+=(1<<i);
        }
        sort(all(a));
    }
    cout<<ans.size()<<endl;
    rep(i,0,ans.size()){
        int l,r,v;tie(l,r,v)=ans[i];
        cout<<l<<' '<<r<<' '<<v<<endl;
    }
    return 0;
}
/*

*/