#include<iostream>

using namespace std;

template<class T>

class Queue

{

public:

    int front,rear;

    T *que;

    int qsize;

Queue(int size)

{

    qsize=size;

    que=new T[qsize];

    front=rear=-1;

}

int isFull()

{

    if(rear==qsize-1)

    {

        return 1;

    }

    else

    {

        return 0;

    }

}

int isEmpty()

{

    if(front==-1||front>rear)

    {

        return 1;

    }

    else

    {

        return 0;

    }

}

void Insert(T item)

{

    if(rear==-1)

        front=0;

    if(isFull())

    {

        cout<<"\nQ is full\n";

    }

    else

    {

        rear=rear+1;

        que[rear]=item;

    }

}

T Delete()

{

    T item;

    if(isEmpty())

    {

    cout<<"Que is empty\n";

    }

    else

    {

        T item;

        item=que[front];

        front=front+1;

        //if(rear=front+1)

        //rear=front=-1;

        //return item;

        cout<<"the value is\t"<<item;

            

    }

}

};

int main()

{

    int ch,val;

    Queue<int>Q1(3);

    do

    {

        cout<<"\n1-insertion\n2-deletion\n";

        cout<<"enter your choice\n";

        cin>>ch;

        switch(ch)

        {

            case 1:cout<<"enter the value\n";

                cin>>val;

                Q1.Insert(val);

                break;

            case 2:Q1.Delete();

                break;

        }

    }while(ch!=3);

}