#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *left,*right;
}Node;
Node *root=NULL;
Node* create(int num){
    Node *newnode=(Node*)malloc(sizeof(Node));
    nenwode->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)
    return root->right=insert(root->right,num);
    else if(num<root->data)
    return root->left=insert(root->left,num);
}
Node *maxmimum(Node *root){
    if(root==NULL)
    return root;
    if(root->right!=NULL)
    return maximum(root->right);
    return root;
}
int main(){
    int num,size,itr;
    scanf("%d",&size);
    for(itr=1;itr<=size;itr++){
        scanf("%d",&num);
        root=inser(root,num);
    }
    maximum(root);
    return 0;
}