#include<stdio.h>
#include<stdlib.h>
struct node{
    int data;
    struct node*next;
};
void printReverse(struct node*curr){
    if(curr==NULL)
    return;
    printreverse(currr->next);
    printf("%d",curr->data);
}
int main(){
    int i,n;
    if(scanf("%d",&n)!=1 ||n<=0){
        printf("Invalid input");
        return 0;
    }
    struct node*head=NULL,*p=NULL,*q=NULL;
    q=malloc(sizeof(struct node));
    if(scanf("%d",&q->data)!=1){
        printf("Invalid input");
        return 0;
    }
    q->next=NULL;
    head=p=q;
    for(i=2;i<=n;i++){
        q=malloc(sizeof(struct node));
        if(scanf("%d",&q->data)!=1){
            printf("Invalid input");
            return 0;
        }
        q->next=NULL;
        p->next=q;
        p=q;
    }
    printReverse(head);
}