#include <bits/stdc++.h>
using namespace std;
vector<int> g[200005];
int fa[200005];
int main()
{
    int n, maxn = -1;
    cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        int x;
        cin >> x;
        maxn = max(maxn, x);
        g[x].push_back(i);
    }
    g[maxn + 1].push_back(0);
    for (int i = maxn; i >= 0; --i)
    {
        int cur = 0;
        while (cur != g[i].size())
        {
            fa[g[i][cur]] = g[i + 1][cur % g[i + 1].size()];
            cur++;
        }
    }
    for (int i = 1; i <= n; ++i) cout << fa[i] << " ";
    return 0;
}