Circular Queue using array

#include <bits/stdc++.h> 
class CircularQueue{
    public:
    int *arr;
    int front;
    int rear;
    int size;
    CircularQueue(int n)
    {
        front=-1;
        rear=-1;
        size=n-1;
        arr=new int[size];

    }

    bool enqueue(int value)
    {
       if((front==0 &&rear==size) ||(rear==(front-1)%(size)))
       {
           return false;
       }
       else if(front==-1)
       {
           front=rear=0;
       }
       else if(rear==size && front !=0 )
       {
           rear=0;
       }
       else
       {
           rear++;
       }
       arr[rear]=value;
       return true;
    }

    
    int dequeue(){
        if(front==-1)
        {
            return -1;
        }
        
        int element=arr[front];
        arr[front]=-1;

        if(front==rear)
        {
            
            front=rear=-1;
        }
        else if(front==size)
        {
            front=0;
        }
        else
        {
            front++;
        }

        return element;

        
    }
};