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