class MyStack {
    Queue<Integer> q = new LinkedList<>();
    Queue<Integer> temp = new LinkedList<>();
    public MyStack() {}
    public void push(int x) {
        q.add(x);
        for(int i=0;i<q.size()-1;i++)
        {
           q.add(q.poll());
        }
    }
    public int pop() {
        return q.remove();
    }
    public int top() {
        return q.peek();
    }
    public boolean empty() {
        return q.isEmpty();
    }
}