222.py

from collections import deque


class MyStack:

    def __init__(self):
        self.queue1 = deque()
        self.queue2 = deque()

    def push(self, x: int) -> None:
        self.queue1.append(x)
        
    def pop(self) -> int:
        
        while len(self.queue1) > 1:
            item = self.queue1.popleft()
            self.queue2.append(item)

        result = self.queue1.popleft()

        while len(self.queue2):
            item = self.queue2.popleft()
            self.queue1.append(item)

        return result

    def top(self) -> int:
        return self.queue1[-1]

    def empty(self) -> bool:
        return len(self.queue1) == 0


# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()