#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node*left,*right;
}a;
a*root;
a*create(int num){
    a*newnode=(a*)malloc(sizeof(a));
    newnode->data=num;
    newnode->left=NULL;
    newnode->right=NULL;
    return newnode;
}
a* ins(a*root,int num){
    if(root==NULL){
        return create(num);
        
    }
    if(num<root->data){
        root->left=ins(root->left,num);
    }
    if(num>root->data){
        root->right=ins(root->right,num);
    }
    return root;
    
}
a*max(a*root){
    if(root==NULL)
        return root;
    if(root->right!=NULL)
        return max(root->right);
    return 0;
        
    }
int main(){
    int s,n,l;
    scanf("%d",&s);
    if(s<=0){
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<s;i++){
        scanf("%d",&n);
        root=ins(root,n);
    }
    a*ans=max(root);
    printf("%d",ans->data);
    return 0;
}
}