#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

template <typename T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

struct io_setup {
	io_setup() {
		ios::sync_with_stdio(false);
		std::cin.tie(nullptr);
		cout << fixed << setprecision(15);
	}
} io_setup;

#include <atcoder/all>

void solve() {
	int n;
	cin>>n;
	vector<int> a(n);
	rep(i,0,n) cin>>a[i];
	auto press=[&](){
		sort(a.begin(),a.end());
		return a[0]==a[n-1];
	};
	vector<array<ll,3>> ans;
	while(1){
		if(press()) break;
		ll md=(a[n-1]+a[0])/2;
		ll ad=a[n-1]-md;
		rep(i,0,n){
			if(a[i]>md){
				ans.push_back({0,i,ad});
				break;
			}
			a[i]+=ad;
		}
	}
	cout<<ans.size()<<endl;
	for(auto[x,y,ad]:ans) cout<<x+1<<" "<<y<<" "<<ad<<"\n";
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}