#include<iostream>
#include<vector>
#include<algorithm>
#include<ranges>
using namespace std;

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

	for(int bit=29;bit>=0;--bit){
		int s = 0;
		int e = 0;
		for(int i=0;i<n;++i){
			if(1<<bit&a[i])break;
			e = i;
		}
		for(int i=s;i<=e;++i){
			a[i] |= 1<<bit;
		}
		if(s<=e)cout << s+1 << ' ' << e+1 << ' ' << (1<<bit) << endl;
		ranges::sort(a);
	}
}