#include <stdio.h>
#include <stdlib.h>

typedef 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 *root, int num){
    if(root == NULL)
        return root;
    if(num < root->data)
        root->left = insert(root->left, num);
    if(num < root->data){
        root->right = insert(root->right, num);
    else
        create(num);
    return root;
}

Node *inorder(Node *root){
    if(root != NULL){
        inorder(root->left);
        printf("%d",root->data);
        inorder(root->right);
    }
}

int main(){
    int size;
    scanf("%d",&size);
    for(int i=0;i<size;i++){
        scanf("%d",&num);
        root = insert(root, num);
    }
    inorder(root);
}