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