Implement Stack using Queues

class MyStack {
    // Two queues.
    Queue<Integer> queue1 = new LinkedList<Integer>();
    Queue<Integer> queue2 = new LinkedList<Integer>();
    
    // Push element x onto stack.
    public void push(int x) {
        if (empty()) {
            queue1.offer(x);
        } else {
            if (queue1.size() > 0) {
                queue2.offer(x);
                int size = queue1.size();
                while (size > 0) {
                    queue2.offer(queue1.poll());
                    size--;
                }
            } else {
                queue1.offer(x);
                int size = queue2.size();
                while (size > 0) {
                    queue1.offer(queue2.poll());
                    size--;
                }
            }
        }
    }

    // Removes the element on top of the stack.
    public void pop() {
        if (empty()) {
            return;
        } else if (queue1.size() > 0) {
            queue1.poll();
        } else {
            queue2.poll();
        }
    }

    // Get the top element.
    public int top() {
        if (empty()) {
            return Integer.MAX_VALUE;
        } else if (queue1.size() > 0) {
            return queue1.peek();
        } else {
            return queue2.peek();
        }
    }

    // Return whether the stack is empty.
    public boolean empty() {
        return queue1.isEmpty() && queue2.isEmpty();
    }
}