#include<stdio.h>
int size=5;top=-1;
int arr[100]
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;
}
void 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]);
    }
}
int main()
{
    int i,num;
    scanf("%d",&size);
    for(i=1;i<=size;i++)
    {
        scanf("%d",num);
        enqueue(num);
    }
    traverse();
}