求问

#include <bits/stdc++.h>
using namespace std;
#define pb(a) push_back(a)
typedef long long ll;
vector<int> a,b;
set<ll> kk;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    ll k;
    cin >> n;
    for(int i=1;i<=n;i++) {cin >> k;a.pb(k);b.pb(i);}
    sort(a.begin(),a.end());
    int f = 0,l;
    do{
        kk.clear();
        int ff = 1;
        for(int i=0;i<n;i++) {
            l = kk.size();
            kk.insert(1LL*a[i]*b[i]);
            if(kk.size()==l) {ff=0;break;}
        }
        if(ff) {f = 1;break;}
    }while(next_permutation(b.begin(),b.end()));
    if(f) for(auto it=b.begin();it!=b.end();it++) cout << *it << ' ';
    else cout << -1;
}