#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
	int n; cin >> n;
	vector<ll> a(n); for(int i=0; i<n; i++) cin >> a[i];

	vector<tuple<int, int, ll>> op;
	while(true){
		int r;
		for(r=n-1; r>=0; r--) if(a[r] < a[n-1]) break;
		if(r == -1) break;

		int m = (r+2)/2;
		op.emplace_back(1, m, a[n-1]-a[m-1]);
		for(int i=0; i<m; i++) a[i] += a[n-1]-a[m-1];
		sort(all(a));
	}

	cout << (int)op.size() << '\n';
	for(auto [l, r, x] : op){
		cout << l << ' ' << r << ' ' << x << '\n';
	}
}

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	
	int T=1;
	//cin >> T;
	while(T--) solve();
}