#include<iostream>
#include<vector>
#include<tuple>
#include<algorithm>
#include<cassert>
using namespace std;
int N,A[2<<17];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N;
	for(int i=0;i<N;i++)cin>>A[i];
	vector<tuple<int,int,int> >T;
	for(int k=30;k--;)
	{
		int r=0;
		while(r<N&&!(A[r]>>k&1))A[r]+=1<<k,r++;
		if(r)T.emplace_back(1,r,1<<k);
		sort(A,A+N);
	}
	cout<<T.size()<<"\n";
	for(auto[x,y,z]:T)cout<<x<<" "<<y<<" "<<z<<"\n";
}