Assuming queue1 is used for performing push operation in O(1) time, we'll require n dequeue and (n - 1) enqueue operations to pop an element. It can be done as :
1) dequeue from queue 1
2) if(queue 1 !empty) enqueue in queue 2
else return that element ( our pop operation )
For different implementations of push and pop operation refer this.