class Queue {
late int maxSize;
late List<int> Array;
late int front;
late int rear;
late int nItems;
Queue(int size) {
maxSize = size;
Array = [1, 3, 5, 7, 9, 11, 13, 15, 17];
front = 0;
rear = 0;
nItems = 0;
}
void insert(int newItem) {
if (rear == maxSize - 1) {
rear = -1;
}
Array[++rear] = newItem;
nItems++;
}
int remove() {
int temp = Array[front++];
if (front == maxSize) {
front = 0;
}
nItems--;
return temp;
}
int peek() {
return Array[front];
}
bool isEmpty() {
if (nItems == 0) {
return true;
}
return false;
}
bool isFull() {
if (nItems == maxSize) {
return true;
}
return false;
}
}