#include<stdio.h>
#include<stdio.h>
typrdef struct node{
    int data;
    struct node *left,*right;
}Node;
Node* root=NULL;

Node*create(int num){
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
    
    
    
}
 
 Node*insert(Node*data,int num){
     if(root==NULL)
       return create(num);
      else if(num<root->data)
        return root->left=insert(root->left,num);
      else if(num>root->data)
        return root->right=insert(root->right,num);
        return root;
 }
  void inorder(Node *root){
      if(root!=NULL){
            inorder(root->left);
            printf("%d",&root->data);
            inorder(root->right);
      }
  }
  void main(){
      int size,i,num;
      scanf("%d",&size);
      if(size<0){
          printf("Invalid input");
          return 0;
      }
      for(i=0;i<size;i++){
          scanf("%d",&num);
         
          root=insert(root,num)
      }
      inorder(root);
      return 0;
  }