#include<iostream>
#include<stack>
using namespace std;
const int N = 100010;
int a[N];
int n;
stack<int> s;
int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++)
    {
        cin >> a[i];
        if(s.empty())
        {
            cout << -1 << " ";
            s.push(a[i]);
            continue;
        }
        if(a[i] > s.top()) 
        {
            cout << s.top() << " ";
            s.push(a[i]);
            continue;
        }
        else  //当前的数比栈顶小
        {
            while(!s.empty() && s.top() >= a[i])
            {
                s.pop();
            }
            if(!s.empty()) cout << s.top() << " ";
            else cout << -1 << " ";
            s.push(a[i]);
        }
    }
    return 0;
}