#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));
    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);
   if(num>root->data)
   root->right=insert(root->right,num);
   return root;
}
void max(Node *root)
{
    if(root==NULL)
    {
        printf("empty");
        return 0;
    }
    while(root->right!=NULL){
    root=root->right;
}
printf("%d ",root->data);
}
int main()
{
    int i,n,num;
    scanf("%d",&n);
    if(n<=0)
    {
        printf("Invallid input");
        return 0;
    }
    for(int i=0;i<n;i++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
    max(root);
}