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