#include <bits/stdc++.h>

 using namespace std;

 typedef pair <int , int> P;

 int a[int(1e5 + )] , ans[int(1e5 + )];

 set <P> v;

 int main()

 {

     int n;

     scanf("%d" , &n);

     for(int i =  ; i < n ; ++i) {

         if(i == ) {

             scanf("%d" , a + i);

             v.insert(P(a[i] , i));

             continue;

         }

         scanf("%d" , a + i);

         auto it = v.upper_bound(P(a[i] , ));

         if(it == v.begin()) {

             ans[i] = it->first;

         }

         else if(it == v.end()) {

             ans[i] = (--it)->first;

         }

         else {

             if(it->second > (--it)->second)

                 ans[i] = (++it)->first;

             else

                 ans[i] = it->first;

         }

         v.insert(P(a[i] , i));

     }

     for(int i =  ; i < n -  ; ++i)

         printf("%d " , ans[i]);

     printf("%d\n" , ans[n - ]);

 }