Stack using a queue

Question

How could I implement a stack using a queue?

Answer 1

push: insert the element into the back of the queue.

pop: remove an element from the front, insert it immediately in the back, repeat N-1 times, where N is the size of the queue, then remove the last element and return it.