import java.util.*;
class node{
    node prev;
    int data;
    node next;
    node(int data){
        this.prev=null;
        this.data=data;
        this.next=null;
    }
}
public class DoubleLinkedlist{
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        if(n<=0||n>1000)
        {
            System.out.print("Invalid input");
            return;
        }
        int[] values=new int[n];
        for(int i=0;i<n;i++){
            values[i]=sc.nextInt();
            if(values[i]<Integer.MIN_VALUE||values[i]>Integer.MAX_VALUE){
                System.out.print("Invalid input");
                return;
            }
        }
        node head=null;
        node tail=null;
        
        for(int i=0;i<n;i++){
        node nn=new node(values[i]);
        if(head==null)
        {
            head=nn;
            tail=nn;
        }else{
            tail.next=nn;
            nn.prev=tail;
            tail=nn;
        }
    }
    node current=head;
    while(current!=null){
        System.out.print(current.data+" ");
        current=current.next;
    }
    System.out.println();
    node current=tail;
    while(current!=null){
        System.out.print(current.data+" ");
        current=current.prev;
    }
    System.out.println();
    }
    
}