#include<stdio.h>
#define QUEUESIZE 5

void insert(struct queue *pq,int x);
int remove(struct queue *pq);
int menue(int ch);

int ch,x;

struct queue
{
	int front,rear;
	int items[QUEUESIZE];
};

void main()
{
	struct queue q;
	q.rear=QUEUESIZE-1;
	q.front=q.rear;

	do
	{
		ch=menue(ch);
		switch (ch)
		{
		case 1:
			{
				insert(&q,x);
			}
			break;
		case 2:
			{
				x=remove(&q);
			}
			break;
		case 3:
			{
			}
			break;
		case 4:
			{
				printf("~~~ Exit ~~~");
			}
			break;
		}
	}while (ch<5);
}

int menue(int ch)
{
	printf("enter your chooes: /n");
	printf("1:insert/n2:delete/n3:display/n4:exit/n");
	scanf("%d",&ch);
	return (ch);
}


void insert(struct queue *pq,int x)
{
	if(pq->rear==QUEUESIZE-1)
		pq->rear=0;
	else
		(pq->rear)++;
	if(pq->rear==pq->front)
	{
		printf("queue overflow");
		return;
	}
	pq->iteme[pq->rear]=x;
	return ;
}

int remove (struct queue *pq)
{
	if(empty(pq))
	{
		printf("queue underflow");
		return;
	}
	if (pq->front==QUEUESIZE-1)
		pq->front=0;
	else
		(pq->front)++;
	return (pq->iteme[p->front]);
}