1
//单调栈
2
#include <bits/stdc++.h>
3
#define endl '\n'
4
using namespace std;
5
typedef long long ll;
6
int main(){
7
    ll n;
8
    cin>>n;
9
    vector<ll> ans(n+2),a(n+2);
10
    deque<ll> dq;
11
    a[n+1]=1e18;
12
    dq.push_back(n+1);
13
    for(ll i=1;i<=n;i++)cin>>a[i];
14
    for(ll i=n;i>=1;i--){
15
        while(a[dq.back()]<=a[i])dq.pop_back();
16
        if(dq.back()==n+1)ans[i]=0;
17
        else ans[i]=dq.back();
18
        dq.push_back(i);
19
    }
20
    for(ll i=1;i<=n;i++){
21
        if(i!=1)cout<<" ";
22
        cout<<ans[i];
23
    }
24
    cout<<endl;
25
    return 0;
26
}