import java.util.*;
class QueueImplement
{
int size,front=0;
int index=-1;
int queue[];
QueueImplement(int m) {
size = m;
queue = new int[size];
}
void enqueue(int element)
{
queue[++index]=element;
}
void dequeue()
{
front++;
}
void display()
{
if(index>-1)
{
for(int i=front;i<=index;i++)
{
System.out.print(queue[i]+"\t");
}
System.out.println();
}
}
boolean isFull()
{
if(index+1>size)
return true;
return false;
}
boolean isEmpty()
{
if(index