// editor2
#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->prev = NULL;
    newnode->next = NULL;
    if(head == NULL){
    head = newnode;
    tail = newnode;
}
else{
    newnode->next=tail->next;
    tail->next= newnode;
    tail = newnode;
    
}
}

void display(){
    if(!head){
        printf("List is empty");
        return 0;
    }
    int max=head->data
    node *temp = head->next;
    while(temp){
        if(temp->data>max)
        max = temp->data;
        temp=temp->next;
    }
printf("%d",max);
}

int main(){
    int n,num;
    scanf("%d",&n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
for (int i =0;i<n;i++){
    scanf("%d",&num);
    create(num);
}
display();
return 0;
}