/*input
5
4 2 5 1 3
*/
#include <bits/stdc++.h>

using namespace std;


int main() {
	int n; 
	cin >> n;
	if (n == 1) {
		cout << 0 << endl;
	}
	else {
		vector<int> arr(n);
		for (int i = 0; i < n; i++) cin >> arr[i];
		vector<int> perm(n);
		iota(perm.begin(), perm.end(), 0);
		sort(perm.begin(), perm.end(), [&](int i, int j) {return arr[i] < arr[j];});
		bool sol = true;
		int sum = arr[perm.front()] + arr[perm.back()];
		for (int i = 1; i != n - i - 1; i++) {
			if (arr[perm[i]] + arr[perm[n - i - 1]] != sum) {
				sol = false;
				break;
			}
		}
		if (!sol) {
			cout << -1 << endl;
		} else {
			vector<int> ans(n);
			for (int i = 0; i < n; i++) ans[perm[i]] = perm[n - i - 1];
			for (int i = 0; i < n; i++) cout << ans[i] + 1<< " ";
			cout << endl;
		}
	}
}