#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\n");
    else
    arr[++top] = num;
}
void enQueue(int num)
{
    if(isFull())
    printf("Queue is Full\n");
    else
    arr[++top] = num;
}
int isEmpty()
{
    if(top == -1)
    return 1;
    else
    return 0;
}
int deQueue()
{
    if(isEmpty())
    printf("Queue is Empty\n");
    else
    {
        printf("%d\n",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 itr,num;
  scanf("%d",&size);
  for(itr=1;itr<=size;ittr++)
  {
      scanf("%d",&num);
      emQueue(num);
  }
  enQueue(num);
  deQueue();
  deQueue();
  deQueue();
  deQueue();
  deQueue();
  deQueue();
  traverse();
  return 0;
}