class CQueue {
Deque<Integer> stack1 = new ArrayDeque<>();
Deque<Integer> stack2 = new ArrayDeque<>();
public CQueue() {
}
public void appendTail(int value) {
stack1.push(value);
}
public int deleteHead() {
if(stack1.isEmpty() && stack2.isEmpty()) return -1;
if(stack2.isEmpty()){
while(!stack1.isEmpty()) stack2.push(stack1.pop());
}
return stack2.pop();
}
}