#include<iostream>
using namespace std;
template<class T>
class CQ
{
public:
    int size,rear,front;
    T *que;
CQ(int s)
{
    size=s;
    que=new T[size];
    front=rear=0;
}
T isFull()
{
    if((rear+1)%size==front)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
int isEmpty()
{
    if(front==rear)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
void insert(T val)
{
    if(!isFull())
    {
        rear=(rear+1)%size;
        que[rear]=val;
    }
    else
    {
        cout<<"CQ is full\n";
    }
}
T Delete()
{
    T val;
    if(!isEmpty())
    {
        front=(front+1)%size;
        val=que[front];
        cout<<"the deleted value is\t"<<val<<"\n";
    }
    else
    {
        cout<<"the cq is empty\n";
    }
}
};
int main()
{
    int ch,val;
    CQ<int>c1(3);
    do
    {
        cout<<"1-insert,2-delete\n";
        cout<<"enter your choice\n";
        cin>>ch;
        switch(ch)
        {
            case 1:
                cout<<"enter the value\n";
                cin>>val;
                c1.insert(val);
                break;
            case 2:
                val=c1.Delete();
                break;
        }
    }while(ch!=3);
}