import java.util.*;

/* 不要用arraylist, insert/remove时间消耗太大 O(n)

* */

class MyCircularQueue{

int[] a;

int front = 0, rear = -1, len = 0;

/** Initialize your data structure here. Set the size of the queue to be k. */

public MyCircularQueue(int k){

a = new int[k];

}

/** Insert an element into the circular queue. Return true if the operation is successful. */

public boolean enQueue(int value){

if (!isFull()) {

rear = (rear + 1) % a.length;

a[rear] = value;

len++;

return true;

} else return false;

}

/** Delete an element from the circular queue. Return true if the operation is successful. */

public boolean deQueue(){

if (!isEmpty()) {

front = (front + 1) % a.length;

len--;

return true;

} else return false;

}

/** Get the front item from thbobe queue. */

public int Front(){

return isEmpty() ? -1 : a[front];

}

/** Get the last item from the queue. */

public int Rear(){

return isEmpty() ? -1 : a[rear];

}

/** Checks whether the circular queue is empty or not. */

public boolean isEmpty(){

return len == 0;

}

/** Checks whether the circular queue is full or not. */

public boolean isFull(){

return len == a.length;

}

}

public class circularQueue {

public static void main(String[] args){

}

}