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

void max(Node *root){
    if(root!=NULL){
        root->right = max(root->right);
    }
    printf("%d",root->data);
}

int main(){
    int size,ind,num;
    scanf("%d",&size);
    if(size<=0){
        printf("Invalid input");
    }
    for(ind=0;ind<size;ind++){
        scanf("%d",&num);
        root = insert(root,num);
    }
    max(root);
}