#include <fstream>
#include<cstdlib>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");
int n;
struct Node
{
       Node* left;
       Node* right;
       int data;
} ;
Node *root;

void insert(int d)
{
     Node* t=new Node();
     Node* parent=new Node();
     t->data=d;
     t->left=NULL;
     t->right=NULL;
     if(root==NULL)
                      root=t;
     else
     {
         Node* current;
         current=root;
         while(current)
         {
                       parent=current;
                       if(t->data < current->data) current=current->left;
                       else current=current->right;
         } 
         if(t->data < parent->data) 
                       parent->left=t;
         else 
                       parent->right=t;
         
     }
     
}

void inordine(Node* p)
{
     if(p!=NULL)
     {
                if(p->left) inordine(p->left);
                g<<p->data<<" ";
                if(p->right) inordine(p->right);
     }
     else return;
}

int main()
{
    int k;
    f>>n;
    for(int i= 1; i<=n; i++)
    {
          f>>k;
          insert(k);  
    }
    inordine(root);
    return 0;
}