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