#include <iostream>
#include <vector>
#include <deque>

using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int &x : a) cin >> x;

    deque<int> red;

    for(int x : a) {

        while(!red.empty() && red.back() < x) {
            red.pop_back();
        }

        if(red.empty()) cout << "-1" << " ";
        else cout << red.back() << " ";

        red.push_back(x);
    }
    cout << endl;
}