#include<stdio.h>
int size, top = -1;
int arr[5];
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)
    returm 1;
    else
    return 0;
}
int deQueue()
{
    if(isEmpty()){
        printf("Queue is Empty");
    }
    else
    {
        printf("%d",arr[0]);
        for(int i=0;i<top;i++)
        arr[i]=arr[i+1];
        top--;
    }
}
void traverse(){
    for(int i=0;i<=top;i++){
        printf("%d",arr[i]);
    }
    printf("\n");
}
int main(){
    int i,num;
    scanf("%d",&size);
    if(size<0)
    {
        printf("Invalid input");
        return 0;
    }
    for(i=1;i<=size;i++)
    {
        scanf("%d",&num);
        enQueue(num);
    }
    traverse();
    return 0;
}