#include<stdio.h>
#include<stdlib.h>
typedef struct node {
    int data;
    struct node *left,*right;
}Node;
Node *root=NULL;
Node *create(num) {
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->light=NULL;
    return newnode;
}
Node *insert(Node *root,int num) {
    if(root==NULL) {
        return create(num);
    }
    if(num>root->data) {
        root->right=insert(root->right,num);
    }
    else if(num<roogt->data) {
        root->left=insert(root->left,num);
    }
    return root;
}
Node *inOrder(Node *root) {
    if(root!=NULL) {
        inOrder(root->left);
        printf("%d",root->data);
        inOrder(root->right);
    }
}
int main()
{
    int size,itr,num;
    scanf("%d",&size);
    scanf("%d",&x);
    if(size<0)
    {
        printf("Invalid input");
        return 0;
    }
    for(itr=1;itr<=size;itr++)
    {
        scanf("%d",num);
        root=insert(root,num);
    }
    inOrder(root);
    return 0;
}