#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
typedef long long LL;
int n,fa[200005],cnt0=0;
struct nd{
    int u,sub;
    bool operator<(const nd& a) const{
        return sub==a.sub?u<a.u:sub>a.sub;
    }
}arr[200005];
int main(){
    scanf("%d",&n);
    for (int i=1;i<=n;++i){scanf("%d",&arr[i].sub);arr[i].u=i;}
    sort(arr+1,arr+1+n);
    int pre=1,prepre=0;
    for (int i=2;i<=n;++i){
        if (arr[i].sub<arr[pre].sub){prepre=pre;pre=i;}
        fa[arr[i].u]=arr[prepre+(i-pre)<pre?prepre+(i-pre):prepre].u;
    }
    for (int i=1;i<=n;++i){printf("%d%c",fa[i]," \n"[i==n]);}
    return 0;
}