#include <bits/stdc++.h>
using namespace std;
char a[100005];
#define N 200005
template < typename T,typename C=vector<T> >
class round_deque{
    public:
        round_deque(){con.resize(N);cap=N;}
        void push_back(T a){
            ++__size;
            ++tail;
            if (__size>cap){throw(runtime_error("full"));}
            while (head>=cap&&tail>=cap){
                head-=cap;tail-=cap;
            }
            con[tail%cap]=a;
        }
        void push_front(T a){
            ++__size;
            --head;
            if (__size>cap){throw(runtime_error("full"));}
            while (tail<0||head<0){
                tail+=cap;head+=cap;
            }
            con[head%cap]=a;
        }
        void pop_back(){
            if (!__size){throw(runtime_error("deque is null"));}
            --__size;
            --tail;
            while (tail<0||head<0){
                tail+=cap;head+=cap;
            }
        }
        void pop_front(){
            if (!__size){throw(runtime_error("deque is null"));}
            --__size;
            ++head;
            while(head>=cap&&tail>=cap){
                head-=cap;tail-=cap;
            }
        }
        T& operator[](long long vis){
            if (vis>=__size){throw(runtime_error("out of range"));}
            return con[(head+vis)%cap];
        }
        bool empty(){
            return !__size;
        }
        long long size(){
            return __size;
        }
    private:
        C con;
        long long __size=0,cap=1,head=1,tail=0;
};
round_deque<int> apple;
int main(){
    int n;
    scanf("%d",&n);
    int tmp,T=n;
    scanf("%d",&tmp);
    apple.push_back(tmp);
    while (--T){
        scanf("%d",&tmp);
        if (tmp>apple[0]){apple.push_back(tmp);}
        else{apple.push_front(tmp);}
    }
    for (int i=0;i<n;i++){if (i){putchar(' ');}printf("%d",apple[i]);}
    return 0;
}