#include <bits/stdc++.h>
// #include "debugging.hpp"
using namespace std;

int main() {
    int n;
    cin >> n;
    long long total = 0;
    vector<int> arr(n);
    for (int& i : arr) {
        cin >> i;
        total += i;
    }

    long long pair_num = (long long)n * (n - 1) / 2;
    if (total * (n - 1) % pair_num != 0) {
        cout << -1 << endl;
        return 0;
    }
    long long target = total * (n - 1) / pair_num;

    map<int, vector<int>> usable_inds;
    for (int i = 0; i < n; i++) {
        usable_inds[arr[i]].push_back(i);
    }

    vector<int> perm(n);
    bool valid = true;
    for (int i = 0; i < n; i++) {
        int match = target - arr[i];
        if (usable_inds[match].empty()) {
            valid = false;
            break;
        }
        perm[i] = usable_inds[match].back();
        usable_inds[match].pop_back();
    }

    if (valid) {
        for (int i = 0; i < n - 1; i++) {
            cout << perm[i] + 1 << ' ';
        }
        cout << perm.back() + 1 << endl;
    } else {
        cout << -1 << endl;
    }
}