栈:先进后出
#include<iostream>
using namespace std;
const int N = 100010;
int stk[N],tt, M;
char op[5];
//插入
stk[ ++ tt] = x;
//弹出
-- tt;
//判断栈是否为空
if(tt > 0){
not empty;
}else{
empty;
}
//查询栈顶
stk[tt]
int main(){
cin >> M;
while(M -- ){
int x;
cin >> op;
if(op[2] == 's'){
cin >> x;
stk[ ++ tt] = x;
}else if(op[1] == 'o'){
-- tt;
}else if(*op == 'e'){
if(tt > 0){
cout << "NO" << endl;
}else{
cout << "YES" <<endl;
}
}else{
cout << stk[tt] << endl;
}
}
return 0;
}