#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->prev=tail->next;
        tail->next=newnode;
        tail=newnode;
    }
}
void findmin(){
    Node *min;
    min=head->next;
    Node*temp=head->next;
    while(temp){
        if(temp->data<min)
          min=temp->data;
          temp=temp->next;
    }
    printf("\n%d",min);
}
void display(){
    Node*itr;
    for(itr=head;itr!=NULL;itr=itr->next){
    printf("%d",itr->data);
    }
}
int main(){
    int n,num;
    scanf("%d",&n);
    if(n<0){
        printf("invaid input");
        return 0;
    }
    for(int i=0;i<n;i++){
        scanf("%d",&num);
        create(num);
    }
    display();
    findmin();
    return 0;
}