#include<iostream>
#include<queue>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<string>
using namespace std;
unsigned long long t,n;
unsigned long long stack[1000005],top;
int main(){
	scanf("%llu",&t);
	for(unsigned long long i=1;i<=t;i++){
		top=0;
		scanf("%llu",&n);
		while(n!=0){
			string a;
			cin>>a;
			if(a=="push"){
				int x;
				scanf("%d",&x);
				stack[++top]=x;
			}else if(a=="pop"){
				if(top==0){
					printf("Empty\n");
				}else{
					top--;
				}
			}else if(a=="query"){
				if(top==0){
					printf("Anguei!\n");
				}else{
					printf("%llu\n",stack[top]);
				}
			}else if(a=="size"){
				printf("%llu\n",top);
			}
			n--;
		}
	}
	return 0;
} 

没啥问题啊…………