#include<stdio.h>
#include<stdlib.h>

// A facc'ro cazz//

typedef struct ll_node_struct{
  int info;
  struct ll_node_struct* next;
} ll_node;


ll_node* push(ll_node* head, int v){
   ll_node* new = malloc(sizeof(ll_node));
   new->info=v;
   new->next=head;
return new;
}

void reverseList(ll_node* l,ll_node* *new){
  if(l==NULL)return;
   *new=push(*new,l->info);
   reverseList(l->next,new);
}

void print(ll_node* head){
  ll_node* curr=head;
  while(curr!=NULL){
  printf("%d\n",curr->info);
  curr=curr->next;

  }
}


 int main(){
  int n;
  ll_node* l=NULL;
  ll_node* new=NULL;

   do{
     scanf("%d",&n);
        l=push(l,n);

     }while(n>0);

   printf("\n\n");
   print(l);
   reverseList(l,&new);
   printf("\n\n");
   print(new);

  return 0;
 }