828. 模拟栈

import java.util.Scanner;

public class Main {
    public static final int N = 100010;
    public static int[] stack = new int[N];
    public static int tt = 0;

    public static void push(int x) {
        stack[++tt] = x;
    }

    public static void pop() {
        tt--;
    }

    public static void empty() {
        if (tt > 0) {
            System.out.println("NO");
        } else {
            System.out.println("YES");
        }
    }

    public static void query() {
        System.out.println(stack[tt]);
    }


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        while (n-- != 0) {
            String bin = sc.next();
            if (bin.equals("push")) {
                int x = sc.nextInt();
                push(x);
            }else if (bin.equals("query")){
               query();
            } else if (bin.equals("pop")) {
                pop();
            }else {
                empty();
            }
        }
    }
}