#include <stdio.h>
#include <stdlib.h>
int size,arr[20],top=-1;
int isFull(){
    if(top==size-1)
        return 1;
    else
        return 0;
}
void enQueue(int num){
    if(isFull){
        printf("Queue is Full");
        return 0;
    }
    else
        arr[++top]=num;
}
int isEmpty(){
    if(top==-1)
        return 1;
    else
        return 0;
}
void deQueue(){
    if(isEmpty()){
        printf("Queue is empty");
        return 0;
    }
    else
        top--;
}
void tarverse(){
    for(int i=0;i<top-1;i++){
        printf("%d ",arr[i]);
    }
}
int main(){
    scanf("%d",&size);
    for(int i=0;i<size;i++){
        scanf("%d",&num);
        enQueue(num);
    }
    for(int i=0;i<size;i++){
        deQueue();
    }
    traverse();
    return 0;
}