#include #define rep(i,a,b) for(int i=a;i=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() #pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> E; int n, m; vector match, dist; void init(int _n,int _m){n=_n,m=_m;E.resize(n+m+2);match.resize(n+m+2);dist.resize(n+m+2);} bool bfs() { queue que; rep(i, 1, n + 1) { if (!match[i]) dist[i] = 0, que.push(i); else dist[i] = inf; } dist[0] = inf; while (!que.empty()) { int u = que.front(); que.pop(); if (u) fore(v, E[u]) if (dist[match[v]] == inf) { dist[match[v]] = dist[u] + 1; que.push(match[v]); } } return (dist[0] != inf); } bool dfs(int u) { if (u) { fore(v, E[u]) if (dist[match[v]] == dist[u] + 1) if (dfs(match[v])) { match[v] = u; match[u] = v; return true; } dist[u] = inf; return false; } return true; } void add(int a, int b) { b += n; E[a + 1].push_back(b + 1); E[b + 1].push_back(a + 1); } int whois(int x) { return match[x + 1] - 1; } int solve() { rep(i, 0, n + m + 1) match[i] = 0; int res = 0; while (bfs()) rep(i, 1, n + 1) if (!match[i] && dfs(i)) res++; return res; } }; /*---------------------------------------------------------------------------------------------------             ∧_∧       ∧_∧  (´<_` )  Welcome to My Coding Space!      ( ´_ゝ`) /  ⌒i     /   \    | |     /   / ̄ ̄ ̄ ̄/  |   __(__ニつ/  _/ .| .|____      \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ int N, A[50]; //--------------------------------------------------------------------------------------------------- void _main() { cin >> N; rep(i, 0, N) cin >> A[i]; BipartiteMatching bm; bm.init(N, N); rep(i, 0, N) rep(j, 0, N) if (A[i] != j) bm.add(i, j); if (bm.solve() != N) { printf("-1\n"); return; } rep(i, 0, N) printf("%d\n", bm.whois(i) - N); }