#include <cstdio>

 #include <cstring>

 #include <string>

 #include <queue>

 #include <stack>

 #include <iostream>

 using namespace std;

 struct node{

     int v;

     node *next;

 };

 int main(){

     //freopen("D:\\INPUT.txt","r",stdin);

     int n;

     node *head;

     while(scanf("%d",&n)!=EOF){

         head=new node();

         //head->v=

         head->next=NULL;

         int i,num;

         node *p,*q;

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

             scanf("%d",&num);

             q=head;

             p=head->next;

             while(p&&num>=p->v){

                 q=p;

                 p=p->next;

             }

             node *t=new node();

             t->v=num;

             q->next=t;

             t->next=p;

         }

         p=head->next;

         cout<<p->v;

         p=p->next;

         while(p){

             cout<<" "<<p->v;

             p=p->next;

         }

         cout<<endl;

     }

     return ;

 }