#include <stdio.h>

#define N 200020

typedef struct {
    int fi;
    int se;
} ii;

int main() {
    int n;
    scanf("%d", &n);
    ii a[N];
    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i].fi);
        a[i].se = i + 1;
    }
    for (int i = 0; i < n; ++i) {
        for (int j = i + 1; j < n; ++j) {
            if (a[i].fi > a[j].fi) {
                ii temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
    }
    int ans[N];
    int sum = a[0].fi + a[n - 1].fi;
    int l = 0, r = n - 1;
    int can = 1;
    while (l <= r) {
        ans[a[l].se - 1] = a[r].se;
        ans[a[r].se - 1] = a[l].se;
        if (a[l].fi + a[r].fi != sum) {
            can = 0;
            break;
        }
        l++;
        r--;
    }
    if (can) {
        for (int i = 0; i < n; ++i)
            printf("%d ", ans[i]);
        printf("\n");
    } else {
        printf("-1\n");
    }
    return 0;
}