import java.util.*;
public class CircularQueue
{
int front,rear,size=5;
int a[]=new int[size];
CircularQueue()
{
front=rear=size-1;
}
void Insert(int n)
{
Ins:
{
if(rear==size-1)
rear=0;
else rear++;
if(rear==front)
{
System.out.println("Overflow");
break Ins;