Write a program to implement a queue using stack.

You can use two stacks and use on as the incoming stack and the other as the outgoing stack.

A queue is a FIFO structure, so when we enqueue something, we need to make sure that it does not get popped off before something that was already there.

Similarly, when we dequeue something, we must make sure that elements that were inserted earlier get removed first.