#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000008, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N], p[N];


int f[N];
int main() {
    cin >> n;
    for (int i = 1; i < n + 1; i++) scanf("%d", w + i);
    int sum = 0;
    for (int i = 29; i >= 0; i--) {
        sum += 1 << i;
        int u = lower_bound(w + 1, w + n + 1, sum) - w;
        printf("%d %d %d\n", 1, u - 1, 1 << i);
        for (int j = 1; j < u; j++) w[j] += 1 << i;
        sort(w + 1, w + n + 1);
    }
    for (int i = 2; i < n + 1; i++) assert(w[i] == w[i - 1]);
   return 0;
}