#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;

#define FOR(i,a,b) for(int (i)=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RANGE(vec) (vec).begin(),(vec).end()

using namespace std;

class BipartiteMatching {
public:
    std::vector<std::vector<int>> G_;
    std::vector<int> match_;
    std::vector<bool> used_;
    BipartiteMatching(int V) {
        G_.resize(V);
    }
    void add_edge(int u, int v) {
        G_[u].push_back(v);
        G_[v].push_back(u);
    }
    bool dfs(int v) {
        used_[v] = true;
        for (int i = 0; i < (int)G_[v].size(); ++i)
        {
            int u = G_[v][i];
            int w = match_[u];
            if (w < 0 || (!used_[w] && dfs(w)))
            {
                match_[v] = u;
                match_[u] = v;
                return true;
            }
        }
        return false;
    }
    int match() {
        int res = 0;
        match_.resize(G_.size(),-1);
        used_.resize(G_.size(), false);
        for (int v = 0; v < (int)G_.size(); ++v)
        {
            if (match_[v] < 0)
            {
                fill(used_.begin(), used_.end(), false);
                if ( dfs(v) )
                    res++;
            }
        }
        return res;
    }
};

class StudentNumber
{
public:
    void solve(void)
    {
        int N;
        cin>>N;

        vector<int> A(N);
        REP(i,N)
            cin>>A[i];

        BipartiteMatching bm(N);

        REP(i,N)
        REP(j,N)
        {
            if ( j != A[i] )
                bm.add_edge(i, j);
        }

        if ( bm.match() == 0 )
            cout<<-1<<endl;
        else
        {
            REP(i,N)
            {
                cout<<bm.match_[i]<<endl;
            }
        }
    }
};

#if 1
int main(int argc, char *argv[])
{
        ios::sync_with_stdio(false);
        auto obj = new StudentNumber();
        obj->solve();
        delete obj;
        return 0;
}
#endif