33分

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<stack>
#include<list>
using namespace std;
#define rt return
#define ull long long
#define MAXN 10000007
#define inf 0x3f3f3f3f
stack<ull>s;
int main(){
	int t,n,num;
	string alpha;
	cin>>t;
	for(int i=0;i<t;i++){
		cin>>n;
		for(int j=0;j<n;j++){
			cin>>alpha;
			if(alpha=="push"){
				cin>>num;
				s.push(num);
			}
			else{
				if(alpha=="pop"){
					if(s.empty()) cout<<"Empty"<<'\n';
					else s.pop();
				}
				else if(alpha=="query"){
					if(s.empty()) cout<<"Anguei!"<<'\n';
					else cout<<s.top()<<'\n';
				}
				else if(alpha=="size") cout<<s.size()<<'\n';
			}
		}
	}
	rt 0;
}