#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *next;
    struct node *prev;
}Node;
Node *head=NULL,*tail;
void create(int num){
    Node *newnode=(Node*)malloc(1*sizeof(Node));
    newnode->data=num;
    newnode->next=newnode;
    if(head==NULL){
        head=newnode;
        tail=newnode;
    }
    else{
        //newnode->prev=tail;
        tail->next=newnode;
        tail=newnode;
    }
}
void  max(){
   if(head==NULL){
       printf("List is empty");
       return ;
   }
   Node *itr=head;
   int max=itr->data;
   while(itr!=NULL){
       if(itr->data>max)
       max=itr->data;
       itr=itr->next;
   }
   printf("%d",max);
}
int main(){
    int n,i,num;
    scanf("%d",&n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    for(i=1;i<=n;i++){
        scanf("%d",&num);
        create(num);
    }
     max();
    return 0;
}