Implement Queue Using Two Stacks

Implement a FIFO queue using only two stacks. Support push x, pop, peek and empty. Print the result of every pop, peek and empty operation, one per line.

1 <= q <= 100 1 <= x <= 9 Pop and peek are only called on a non-empty queue