#include <stdio.h>
#define MAX 10000
struct queue {
    int arr[MAX];
    int front, rear, size, capacity;
};
void initQueue(struct Queue* q, int caapacity) {
    q->capacity = capacity;
    q->front = 0;
    q->size = 0;
    q->rear = -1;
}
int isfull(struct Queue* q) {
    return q->size == q->capacity;
}
void enqueue(struct Queue* q, int item) {
    if (isFull(q)) {
        return;
    }
    q->rear = (q->rear + 1) % q->capacity;
    q->arr[q->rear] = item;
    q->size++;
}
void printQueue(struct Queue* q) {
    int i;
    for (i = 0; i < q->size; i++) {
        int index = (q->front + i) % q->capacity;
        printf("%d", q->arr[index]);
    }
}
int main() {
    int n;
    scanf("%d", %n);
    struct Queue q;
    initQueue(&q, n);
    for (int i = 0; i < n; i++){
        int x;
        scanf("%d", &x);
        enqueue(&q, x);
    }
    printQueue(&q);
    return 0;
}