#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *right,*left;
}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 *min(Node *root)
{
    if(root==NULL
    return root;
    if(root->left!=NULL))
    return min(root->left);
    return root;
}
int main()
{
    int n,i,num;
    scanf("%d",&n);
    for(i=1;i<n;i++);
}
   if(!scanf("%d",&num))
   {
       printf("Invalid input");
       return 0;
   }
   root=insert(root,num);
   {
       Node *ans=min(root);
       printf("%d",ans->data);
   }