Queue using java

public class queue {
int ar[]=new int [5];
int front = -1;
int rear = -1;
int count=5;
public void enqueue(int a) {
if(rear == 5) {
System.out.println("queue is full");
}
else {
ar[rear+1]=a;
rear +=1;
if(front == -1) {
front+=1;

	  }
	  count-=1;
  }
	  }
  public void dequeue() {
	  if(rear == -1) {
		  System.out.println("Queue is empty");
	  }
	  if(count==5) {
		 // System.out.println("queue is empty");
		  front=-1;
		  rear=-1;
	  }
	  else {
	  front+=1;
	  count+=1;
	  }
  }
  public void print() {
	  if(front==-1 && rear==-1) {
		  System.out.println("qqueue is empty");
	  }
	  else {
	for(int i=front;i<=rear;i++) {
		System.out.println(ar[i]);
	}
	  }
  }
public static void main(String[] args) {
	// TODO Auto-generated method stub
   queue q = new queue();
   //q.dequeue();
   q.enqueue(5);
   q.enqueue(6);
   q.enqueue(9);
   q.dequeue();
   q.dequeue();
   q.enqueue(32);
   q.enqueue(58);
   q.dequeue();
   //q.dequeue();
   //q.dequeue();
   //q.dequeue();
  // q.dequeue();
  // System.out.println(q.front);
   //System.out.println(q.rear);
   q.print();
   
}

}