#include<stdio.h>
#include<algorithm>
#include<fstream>
#define Nmax 500030

int N,x;
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
struct nod
{
    int val;
    nod *st,*dr;
} *bst,*NIL;
typedef struct nod nod;

nod* insert(nod* &p,int k)
{
      if (p == NIL)
      {       nod* a=new nod;
              p=a;
              p->val = k,p->st = p->dr = NIL;

              return p;
      }




        if(p->val < k)
        {
            return insert(p->dr,k);

        }
        else
        {
            return insert(p->st,k);
        }






}
void parcurge(nod *p)
{
    if(p==NULL)
    return;
    parcurge(p->st);
    fout<<p->val<<" ";
    parcurge(p->dr);
}
int main()
{

fin>>N;

for(int i=1;i<=N;++i)
    {
       fin>>x;
        insert(bst,x);
    }


parcurge(bst);
}