#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);
    else if(num>root->data)
      root->right=insert(root->right,num);
     return root;
}
void inorder(Node *root)
{
    if(root!=NULL)
    {
        inorder(root->left);
        printf("%d",root->data);
        inorder(root->right);
    }
}
Node* max(Node *root)
{
    if(root==NULL)
      return root;
    while(root->right!=NULL)
      root=root->right;
    return root;  
}


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