import java.util.ArrayList;

import java.util.List;

//leetcode submit region begin(Prohibit modification and deletion)

class MyCircularDeque {

//元素个数.

private int count = 0;

private int size;

private List<Integer> list = new ArrayList<>();

/**

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

*/

public MyCircularDeque(int k) {

size = k;

}

/**

* Adds an item at the front of Deque. Return true if the operation is successful.

*/

public boolean insertFront(int value) {

if (count == size) {

return false;

}

list.add(0, value);

count++;

return true;

}

/**

* Adds an item at the rear of Deque. Return true if the operation is successful.

*/

public boolean insertLast(int value) {

if (isFull()) return false;

list.add(value);

count++;

return true;

}

/**

* Deletes an item from the front of Deque. Return true if the operation is successful.

*/

public boolean deleteFront() {

if (isEmpty()) return false;

list.remove(0);

count--;

return true;

}

/**

* Deletes an item from the rear of Deque. Return true if the operation is successful.

*/

public boolean deleteLast() {

if (isEmpty()) return false;

list.remove(count - 1);

count--;

return true;

}

/**

* Get the front item from the deque.

*/

public int getFront() {

return isEmpty() ? -1 : list.get(0);

}

/**

* Get the last item from the deque.

*/

public int getRear() {

return isEmpty() ? -1 : list.get(count - 1);

}

/**

* Checks whether the circular deque is empty or not.

*/

public boolean isEmpty() {

return count == 0;

}

/**

* Checks whether the circular deque is full or not.

*/

public boolean isFull() {

return count == size;

}

}