#include<stdio.h>
#include<stdlib.h>
int arr[20],top=-1,size;
int isfull(){
    if(top==size-1)
        return 1;
    else
        return 0;
}
void enqueue(int num){
    if(isfull())
        printf("queue is full");
    else
        arr[++top]=num;
}
int isempty(){
    if(top==-1){
        return 1;
    }
    else
        return 0;
    
}
int dequeue(int num){
    if(isempty()){
        printf("queue is empty");
        return 0;
    }
    else
    top--;
}
void traverse(){
    for(int itr=0;itr<top;itr++){
        printf("%d ",int->data);
    }
}
int main(){
    int n,i;
    scanf("%d",&size);
    for(i=0;i<size;i++){
        scanf("%d",&n);
        enqueue(num);
    }
    traverse();
    return 0;
}