circular queue Using Array

import java.util.Scanner;
public class CircularQueueExample
{

    int ar[];
    int Front;
    int Rear;
    CircularQueueExample()
                 {
                     ar=new int[5];
                     Front=  -1;
                     Rear = -1;
                 }

        void insert()
        {


            if((Front==0&&Rear==4)||(Rear==Front-1)){
                {
                     System.out.println("Queue is full");

                }
                  else
            {

                System.out.println("enter the element");
                Scanner sc = new Scanner(System.in);
                int var =sc.nextInt();

                if(Front==-1)
                {
                    Front=0;
                }
                 if(Rear<4)
                {
                    Rear=Rear+1;
                    ar[Rear]=var;

                }
                else if(Rear==4&&Front!=0)
                {
                    Rear=0;
                    ar[Rear]=var;
                }


                    System.out.println("element inserted");
            }
    }
        void delete()
    {
        if(Front==-1)
        {
            System.out.println("Queue empty");
        }
        else
        {
            if(Front==Rear)
            {
                System.out.println("deleted "+ar[Front]);
                Front=-1;
                Rear=-1;
            }
            else if(Front<Rear)
            {
                System.out.println("deleted "+ar[Front]);
                Front=Front+1;
            }
            else if(Rear<Front&&Front<4)
            {
                System.out.println("deleted "+ar[Front]);
                Front=Front+1;

            }
	    else if(Rear<Front&& Front<4){
		System.out.println("Deleted "+ar[Front]);
		Front=Front+1;

            }

        }


        void traverse()
        {

        if(Front==-1)
        {
           System.out.println("queue is empty");

        }
        else
        {
            if(Rear<Front)
            {
                for(int i=Front;i<=4;i++)
                {
                    System.out.println(" "+ar[i]);

                }
            }
                for(int i=0;i<=Rear;i++)
                {
                    System.out.println(" "+ar[i]);
                }
            }
            else
            {
                for(int i=Front;i<=Rear;i++)
                {
                    System.out.println(" "+ar[i]);
                }



            public static void main(String args[])
            {
                 CircularQueueExample obj = new CircularQueueExample();
            }


        while(true)
        {
            System.out.println("press 1 for insert");
            System.out.println("press 2 for delete");
            System.out.println("press 3 for traverse");
            System.out.println("press 4 for exit");

            System.out.println("enter ur choice");
            Scanner choice = new Scanner (System.in);
            int ch = choice.nextInt();

            switch(ch)
            {
                case 1:
                    obj.insert();
                    break;
                case 2:
                    obj.delete();
                case 3:
                    obj.traverse();
                    break;
                case 4:
                    System.exit(0);
                    break;
                default:
                    System.out.println("invalid choice");
}

        }
    }
}