ttt

#include <algorithm>
#include <vector>
#include <iostream>
#include <set>

using namespace std;

int main() {
    int n, k;
    vector<int> a;
    set<pair<int, int>> s;
    cin >> n;
    vector<int> m(n, -1), x(n, -1);
    for (int i = 0; i < n; i++) {
        cin >> k;
        a.push_back(k);
        auto j = upper_bound(s.begin(), s.end(), make_pair(k, 0));
        if (j != s.end()) {
            m[i] = (*j).second;
        }
        s.insert(make_pair(k, i));
    }
    s.clear();
    for (int i = 0; i < n; i++) {
        auto j = upper_bound(s.begin(), s.end(), make_pair(a[i] * (-1), 0));
        if (j != s.end()) {
            x[i] = (*j).second;
        }
        s.insert(make_pair(a[i] * (-1), i));
    }
    for (int i = 1; i < n; i++) {
        cout << a[max(m[i], x[i])] << ' ';
    }
}