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