#include<stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *right, *left;
}Node;

Node *root=NULL;

Node *create(int num)
{
    Node *nd=(Node*)malloc(sizeof(Node));
    nd->data=num;
    nd->right=NULL;
    nd->right=NULL;
    return nd;
}
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);
}
Node *maximum(Node *root)
{
    if(root==NULL)
        return root;
    if(root->right != NULL)
        return maximum(root->right);
    return root;
}
int main()
{
    int size,num,itr,x;
    scanf("%d",&size);
    scanf("%d",&x);
    if(size<=0)
    {
        printf("Invalid input");
        return 0;
    }
    if(X<0)
    {
        printf("Invalid input");
        return 0;
    }
    fot(itr=1;itr<=size;itr++)
    {
        scanf("%d",&num);
        root=insert(root,num);
    }
    printf("%d ",maximum(root)->data);
    return 0;
}