#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

const int N = 1e5 + 50;
const int M = 1e5 + 50;
const int Mod = 1e9 + 7;

#define int long long

inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}

int n, m;

struct node
{
    int v, id;
} ax[N];

bool cmp(node x, node y)
{
    return x.v < y.v;
}

bool flag = 0;

void print(int a, int b, int c, int d, int e, int f)
{
    printf("%lld %lld %lld %lld %lld %lld", a, b, c, d, e, f);
}

bool check(int a, int b, int c, int d, int e, int f, int p1, int p2, int p3, int p4, int p5, int p6)
{
    int ap = ax[p1].id, bp = ax[p2].id, cp = ax[p3].id, dp = ax[p4].id, ep = ax[p5].id, fp = ax[p6].id;
    if (a < b + c && d < e + f)
    {
        print(ap, bp, cp, dp, ep, fp);
        return true;
    }
    if (a < b + d && c < e + f)
    {
        print(ap, bp, dp, cp, ep, fp);
        return true;
    }
    if (a < b + e && c < d + f)
    {
        print(ap, bp, ep, cp, dp, fp);
        return true;
    }
    if (a < b + f && c < d + e)
    {
        print(ap, bp, fp, cp, dp, ep);
        return true;
    }
    if (a < c + d && b < e + f)
    {
        print(ap, cp, dp, bp, ep, fp);
        return true;
    }
    if (a < c + e && b < d + f)
    {
        print(ap, cp, ep, bp, dp, fp);
        return true;
    }
    if (a < c + f && b < d + e)
    {
        print(ap, cp, fp, bp, dp, ep);
        return true;
    }
    if (a < d + e && b < c + f)
    {
        print(ap, dp, ep, bp, cp, fp);
        return true;
    }
    if (a < d + f && b < c + e)
    {
        print(ap, dp, fp, bp, cp, ep);
        return true;
    }
    if (a < e + f && b < c + d)
    {
        print(ap, ep, fp, bp, cp, dp);
        return true;
    }
    return false;
}

signed main()
{
    // freopen("in.in", "r", stdin);
    n = read();
    for (int i = 1; i <= n; ++i)
        ax[i].v = read(), ax[i].id = i;
    sort(ax + 1, ax + n + 1, cmp);
    // cout << (a[n] < a[n - 1] + a[n - 2]) << "-" << (a[n - 3] < a[n - 4] + a[n - 5]) << endl;
    for (int i = n; i >= 6; i--)
    {
        // if (a[i] >= a[i - 1] + a[i - 2])
        // continue;
        if (!check(ax[i].v, ax[i - 1].v, ax[i - 2].v, ax[i - 3].v, ax[i - 4].v, ax[i - 5].v, i, i - 1, i - 2, i - 3, i - 4, i - 5))
            continue;
        // printf("\n%d %d %d %d %d %d", i, i - 1, i - 2, i - 3, i - 4, i - 5);
        flag = 1;
        return 0;
    }
    if (!flag)
    {
        puts("-1");
    }
    return 0;
}