// editor4
#include<stdio.h>
#include<stdlib.h>
struct Node{
    int data;
    struct Node*next;
    
};
struct Node*createNode(int data){
    struct Node*newNode=(struct Node*)malloc(sizeof(struct Node));
    newNode->data=data;
    newNode->next=NULL;
    return newNode;
}
struct NOde*reverse(struct Node*head)
{
    struct Node*reversed=NULL;
    struct Node*current=head;
    while(current!=NULL){
        struct Node*newNode=createNode(current->data);
        newNode->next=reversed;
        reversed=newNode;
        current=current->next;
    }
    return reversed;
    
}
void printlist(struct Node*head)
{
    struct Node*temp=head;
    while(temp!=NULL)
    {
        printf("%d",temp->data);
        temp=temp->next;
    }
    printf("\n");
}
int main()
{
    int n;
    scanf("%d",&n);
    if(n<=0)
    {
        printf("Invalid input");
        return 0;
    }
    struct Node*head=NULL,*tail=NULL;
    for(int i=0;i<n;i++)
    {
        int val;
        scanf("%d",&val);
        struct Node*newNode=createNode(val);
        if(head==NULL)
        {
            head=tail=newNode;
            
        }
        else{
            tail->next=newNode;
            tail=newNode;
        }
    }
    struct Node*reversecopy=reverse(head);
    printlist(head);
    printlist(reversecopy);
    return 0;
}