#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 create(num);
    if(num < root->data)
     root->left=insert(root->left,num);
    if(num > root-> data)
     root->right=insert(root->right,num);
    return root;
}
Node *minimum(Node *root)
{
    if(root==NULL)
     return root;
    if(root->left!=NULL)
     return minimum(root->left);
    return root;
}
void inOrder(Node *root)
{
    if(root!=NULL)
    {
        inOrder(root->left);
        printf("%d ",root->data);
        inOrder(root->right);
    }
}
int main()
{
    int i,n,num;
    scanf("%d",&n);
    for(i=0;i<=n;i++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
   printf("%d",minimun(root,num));
    inOrder(root);
}