#include <cstdio>

 #include <cstring>

 #include <string>

 #include <queue>

 #include <stack>

 #include <iostream>

 using namespace std;

 struct node{

     node *fro,*next;

     int v;

 };

 int main(){

     //freopen("D:\\INPUT.txt","r",stdin);

     node *head,*tail;

     int n;

     while(scanf("%d",&n)!=EOF){

         if(!n){

             cout<<"NULL"<<endl;

         }

         else{

             head=new node();

             tail=head;

             head->fro=head->next=NULL;

             scanf("%d",&head->v);

             int i;

             node *p;

             for(i=;i<n;i++){//输入

                 p=new node();

                 p->fro=tail;

                 tail->next=p;

                 scanf("%d",&p->v);

                 p->next=NULL;

                 tail=p;

             }

             cout<<tail->v;

             p=tail->fro;

             delete tail;

             p->next=NULL;

             tail=p;

             while(tail!=head){//转置链表

                 cout<<" "<<tail->v;

                 p=tail->fro;

                 delete tail;

                 tail=p;

             }

             cout<<" "<<tail->v<<endl;

             delete head;

         }

     }

     return ;

 }