#include <stdio.h>
#include <stdlib.h>
struct Node {
    int data;
    struct Node* prev;
    struct Node* next;
};
struct Node* createNode(int data) {
    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
    newNode->data = data;
    newNode->prev = NULL;
    newNode->next = NULL;
    return newNode;
}
void insertEnd(struct Node** head,int data) {
    struct Node* newNode = createNode(data);
    if (*head == NULL) {
        *head = newNode;
        return;
    }
    struct Node* temp = *head;
    while (temp->next = NULL) {
        temp = temp->next;
    }
    temp->next = newNode;
    newNode->prev = temp;
}
void display(struct Node* head) {
    struct Node* temp = head;
    while (temp != NULL) {
        printf("%d", temp->data);
        temp = twmp->next;
        }
    }
    int main() {
        int n;
        if (scanf("%d", &n) != 1) {
            printf("Invalid input");
            return 0;
        }
        if (n <= 0) {
            printf("Invalid inputt");
            return 0;
        }
        struct Node* head = NULL;
        int value;
        for (int i = 0; i < n; i++) {
            if (scanf("%d", &value) != 1)
            {
                printf("Invalid input");
                return 0;
            }
            insertEnd(&head, value);
        }
        display(head);
        return 0;
}