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

#define ll long long
#define ull unsigned long long
#define nl '\n'
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define rall(s)  s.rbegin(), s.rend()
#define getline(s) getline(cin>>ws,s)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define pi  3.141592653589793

/*
███╗░░██╗███████╗░██████╗░███╗░░░███╗
████╗░██║██╔════╝██╔════╝░████╗░████║
██╔██╗██║█████╗░░██║░░██╗░██╔████╔██║
██║╚████║██╔══╝░░██║░░╚██╗██║╚██╔╝██║
██║░╚███║███████╗╚██████╔╝██║░╚═╝░██║
╚═╝░░╚══╝╚══════╝░╚═════╝░╚═╝░░░░░╚═╝

*/

void Fast_IO(){
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
// freopen("filename.in", "r", stdin), freopen("filename.txt", "w", stdout);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}


bool comp(pair<ll,ll>&a,pair<ll,ll>&b){
    if(a.first==b.first) return a.second<b.second;
    return a.first<b.first;
}


void solve(){
  ll n; cin>>n;
  vector<pair<ll,ll>>v;
  for(int i=1; i<=n; i++){
      ll x; cin>>x;
      v.push_back({x,i});
  }
  sort(all(v),comp);
  vector<ll>res;
    while(1){
    auto maxe = *max_element(all(v));
        if(maxe.first==0) break;
        for(int i=0; i<n; i++){
        if(v[i].first==maxe.first){
        res.push_back(v[i].second);
        v[i].first--;
        break;
        }
        }

    }
    for(int i=1; i<sz(res); i++){
        if(res[i] == res[i-1]) return void(cout<<"-1");
    }
    for(auto&i:res) cout<<i<<' ';





    }

int main(){
    Fast_IO();
int t =1;
//cin>>t;
while(t--){
solve();
}
return 0;
}