#include <bits/stdc++.h>
using namespace std;
int main(){
    long t;
    cin>>t;
    double t2 = (double)(t);
    double sum = 0;
    long x;
    vector<long> nums;
    map<long, long> myMap;
    long c = 0;
    while (t--){
        c++;
        cin>>x;
        nums.push_back(x);
        myMap.insert(pair<long,long>(x,c));
        sum+=(2*((double)(x)/t2));
    }
    long av = (long) sum+0.1;
    if (sum - (int)sum > 0.00000005){
        cout<<-1<<endl;
        return 0;
    }
    vector<long> ans;
    double newSum = 0;
    for (long curr: nums){
        ans.push_back(av-curr);
        newSum+=2*(double)(av-curr)/t2;
    }
    if (newSum - sum < 0.0000001){
        for (long i = 0; i < ans.size() - 1; i++){
            cout<<myMap[ans[i]]<<" ";
        }
        cout<<myMap[ans[ans.size()-1]]<<endl;
    } else{
        cout<<-1<<endl;
    }
    return 0;
}