#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 num){
    if(root==NULL)
        return create(num);
    if(num<(root->data)){
        root->left = insert(root->left,num);
    }
    else if(num > (root->data)){
        root->right = insert(root->right,num);
    }
    return root;
}

Node*max(Node*root){
    if(root==NULL){
        return root;
    }
    else if(root->right!=NULL){
        return max(root->right);
    }
    return root;
}

int main(){
    int size,itr,num;
    scanf("%d",&size);
    if(size<=0){
        printf("Invalid input");
        return 0;
    }
    
    for(itr=1;itr<=size;itr++){
        scanf("%d",&num);
        if(num=='')
            continue;
        root = insert(root,num);
    }
    root=max(root);
    printf("%d",root->data);
    return 0;
}