#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *next;
    struct node *prev;
}s2;

s2 *head=NULL,*tail=NULL;
s2 *temp=NULL;
int min=0;
void create(int num){
    s2 *new=(s2*)malloc(sizeof(s2));
    new->data=num;
    new->prev=NULL;
    new->next=NULL;
    if(head==NULL){
        head=new;
        tail=new;
    }else{
        tail->next=new;
        new->prev=tail;
        tail=new;
    }
}
void display(){
    s2 *i;
    for(i=head;i!=NULL;i=i->next){
        printf("%d ",i->data);
    }
    printf("\n");
}
void find(){
    s2 *i;
    while(!=NULL){
        if(i->data<min){
            min=i->data;
        }
        i=i->next;
    }
    printf("%d ",min);
}

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