#include <iostream>

using namespace std;

class queue
{
    int size;
	int queue1[5];
	int rear, front;
    public:
	queue()
	  {
		rear=-1;
		front=-1;
	  }

	void insert(int x)  //enque
	{
	    if(rear > 3)
	      {
		  cout<<"queue over flow";
		  front=-1;
		  return;
	      }
	    queue1[++rear]=x;
	    cout<<"inserted"<<x;
	}

	void delet()
	 {
	    if(front==rear)
	      {
		cout<<"queue under flow";
		return;
	      }
	    cout<<"deleted"<<queue1[++front];
	 }

	void display()
	 {
	    if(rear==front)
	      {
		cout<<"queue empty";
		return;
	      }
	    for(int i=front+1;i<=rear;i++)
	      {
		cout<<queue1[i]<<" ";
	      }
	 }

};

int main()
{
	int ch;
	queue qu;
	while(1)
	  {
	    cout<<"\n1.Insert 2.Delete 3.Display 4.Exit\n\nEnter your choice";
	    cin>>ch;
	    switch(ch)
	      {
	        case 1: cout<<"Enter the element";
	          cin>>ch;
	          qu.insert(ch);
	          break;

	        case 2:qu.delet(); break;
	        case 3:qu.display(); break;
	        default: exit(0);
	      }
	  }
return (0);
}