#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	vector<tuple<int, int, int>> ans;
	auto op = [&](int l, int r, int v) {
		ans.emplace_back(l, r, v);
		for (int i = l; i <= r; i++) a[i] += v;
		sort(a.begin(), a.end());
	};

	while (a[0] != a[n - 1]) {
		int z = a[0] ^ a[n - 1];
		rrep(i, 30) {
			if (1 & (z >> i)) {
				rep(j, n) {
					if (1 & (a[j] >> i)) {
						op(0, j - 1, (1 << i));
						break;
					}
				}
				break;
			}
		}
	}

	cout << ans.size() << endl;;
	for (auto[l, r, v] : ans) cout << l + 1 << " " << r + 1 << " " << v << "\n";
	return 0;
}