#include <stdio.h>
#define N 5
int queue[N];
int front=-1;
int rear=-1;
void enqueue(int x)
{
    if (rear==N-1)
    {
        printf("the queue is empty");
    }
    else if (front==-1&rear==-1)
    {
        front=rear=0;
        queue[rear]=x;
    }
    else
    {
        rear++;
        queue[rear]=x;
    }
}
void dequeue() 
{
    if(front==-1&rear==-1)
    {
        printf("the queue is empty");
    }
    else if(front=rear)
    {
        front=rear=-1;
    }
    else
    {
        printf("%d",queue[front]);
        front++;
    }
}
void display()
{
    int i;
    if (front==-1&rear==-1)
    {
        printf("the list is empty");
    }
    else
    {
        for(i=0;i<rear+1;i++)
        {
            printf(" %d",queue[i]);
        }
    }
}
void peek()
{
    if (front==-1&rear==-1)
    {
        printf("the queue is empty");
    }
    else
    {
        printf(" The peek element is: %d",queue[front]);
    }
}

void main()
{
    enqueue(5);
    enqueue(1);
    enqueue(6);
    enqueue(2);
    dequeue();
    enqueue(8);
    enqueue(1);
    enqueue(5);
    enqueue(4);
    display();
    peek();
    
}