//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
ll a[200200];
map<ll,vector<int>> Mp;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	ll sum=0;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		sum+=a[i];
	}
	sum*=2;
	if(sum%n) die("-1");
	sum/=n;
	multiset<ll> ms1,ms2;
	for(int i=1;i<=n;i++)
	{
		ms1.insert(a[i]);
		ms2.insert(sum-a[i]);
	}
	if(ms1!=ms2) die("-1");
	for(int i=1;i<=n;i++)
		Mp[a[i]].pb(i);
	for(int i=1;i<=n;i++)
	{
		cout<<Mp[sum-a[i]].back()<<" ";
		Mp[sum-a[i]].pop_back();
	}
	return 0;
}