#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n,y,x;
bool ok;
struct node{
	ll x,p;
	bool operator < (const node t) const{
		return x < t.x;
	}
}a[100005];
int main(){
	cin >> n;
	for(ll i = 1;i <= n;i++){
		cin >> a[i].x;
		a[i].p = i;
	}sort(a + 1,a + n + 1);	
	y = n;
	while(1){
		for(ll i = y;i >= 6;i--){
			if(a[i].x < a[i - 1].x + a[i - 5].x)
				if(a[i - 2].x < a[i - 3].x + a[i - 4].x){
					cout << a[i].p << " " << a[i - 1].p << " ";
					cout << a[i - 5].p << " " << a[i - 2].p << " ";
					cout << a[i - 3].p << " " << a[i - 4].p;
					return 0;
				}
			if(a[i].x >= a[i - 1].x + a[i - 2].x)y = i;
			else break;
		}if(ok){
			y--;
			continue;
		}
		if(y < 6){
			cout << -1;
			return 0;
		}x = y - 3;
		for(ll i = y - 3;i >= 3;i--)
			if(a[i].x >= a[i - 1].x + a[i - 2].x)x = i;
			else break;
		if(x < 3){
			y--;
			ok = 1;
			continue;
		}cout << a[y].p << " " << a[y - 1].p << " ";
		cout << a[y - 2].p << " " << a[x].p << " ";
		cout << a[x - 1].p << " " << a[x - 2].p << " ";
		return 0;
	}return 0;
}