#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;
    }
}
int largest(Node *head){
    if(head==NULL){
        printf("empty");
        return -1;
    }
    int max=head->data;
    Node *itr=head->next;
    while(itr!=NULL){
        if(itr-> data >max)
        max=itr->data;
        itr=itr->next;
    }
    return max;
}
void display(){
    Node *itr=head;
    while(itr!=NULL){
        printf("%d",itr->data);
        itr=itr->next;
    }
    printf("\n");
    
}
int main(){
    int n,i,num,Largest;
    scanf("%d",&n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    for(i=1;i<=n;i++){
        scanf("%d",&num);
        create(num);
    }
     display();
     Largest=largest(head);
     if(largest!=1){
         print("%d",largest);
     }
    return 0;
}