#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(1*sizeof(Node));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}

Node* insert(Node* root,int data){
    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;
}

int min(Node* root){
    if(root == NULL)
    return -1;
    while(root->left != NULL)
    root=root->left;
    return root->data;
}

int main(){
    int n,val;
    if(scanf("%d",&n) n<=0){
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<n;i++){
        if(scanf("%d",&val)!=1){
            printf("Invalid input");
            return 0;
        }
        root=insert(root,val);
    }
    printf("%d",min(root));
    return 0;
}