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