#include <iostream>

using namespace std;

const int N = 100010;

int n;
int a[N], s[N], stk[N], tt;  // stk栈中存储的是下标i

int main()
{
    cin >> n;

    for (int i = 1; i <= n; i ++) cin >> a[i];

    for (int i = 1; i <= n; i ++)
    {
        while (tt && a[stk[tt]] < a[i])
        {
            s[stk[tt]] = i;
            tt --;
        }
        stk[++ tt] = i;
    }

    for (int i = 1; i <= n; i++) cout << s[i] << endl;
    return 0;
}