#define SIZE 1000



class Myqueue

{

    int *arr;

    int capacity;

    int front; 

    int rear;  

    int count;



public:

    Myqueue(int size = SIZE);



    void dequeue();

    void enqueue(int x);

    int peek();

    int size();

    bool isEmpty();

    bool isFull();

};

Myqueue::Myqueue(int size) {

    arr = new int[size];

    capacity = size;

    front = 00;

    rear = -1;

    count = 00;

}





void Myqueue::dequeue() {

    if (isEmpty()) {

         cout << "UnderFlow\nProgram Terminated\n";

         exit(EXIT_FAILURE);

    }



    cout << "Removing " << arr[front] << '\n';



    front = (front + 1) % capacity;

    count--;

}



void Myqueue::enqueue(int item) {

    if (isFull()) {

         cout << "OverFlow\nProgram Terminated\n";

         exit(EXIT_FAILURE);

    }



    cout << "Inserting " << item << '\n';



    rear = (rear + 1) % capacity;

    arr[rear] = item;

    count++;

}



int Myqueue::peek() {

    if (isEmpty()) {

         cout << "UnderFlow\nProgram Terminated\n";

         exit(EXIT_FAILURE);

    }

    return arr[front];

}



int Myqueue::size() {

    return count;

}



bool Myqueue::isEmpty() {

    return (size() == 0);

}



bool Myqueue::isFull() {

    return (size() == capacity);

}

int main() {

    Myqueue q(5);



    q.enqueue(1);

    q.enqueue(2);

    q.enqueue(3);



    cout << "Front element is: " << q.peek() << endl;

    q.dequeue();



    q.enqueue(4);



    cout << "Queue size is " << q.size() << endl;



    q.dequeue();

    q.dequeue();

    q.dequeue();



    if (q.isEmpty())

         cout << "Queue Is Empty\n";

    else

         cout << "Queue Is Not Empty\n";



    return 0;

}