33分求调，必关

#include<iostream>
#include<stack>
using namespace std;
unsigned long long t,n,l;
stack<int> p; 
string s;
int main(){
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>s;
			if(s=="push"){
			   cin>>l;
				p.push(l);
			}else if(s=="pop"){
				if(!p.empty()){
					p.pop();
					continue;
				}
				cout<<"Empty"<<endl;
			}else if(s=="query"){
				if(!p.empty()){
					cout<<p.top()<<endl;
					continue;
				}
				cout<<"Anguei!"<<endl;
			}else cout<<p.size()<<endl;
		}
	}
	return 0;
}