#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>

using namespace std;

const int N = 1e6+10;
unsigned long long stack[N];
int pos;

int main(){
    int T,n;
    unsigned long long x;
    string op;
    cin>>T;
    
    while(T>0){
        T--;
        cin>>n;
        while(n>0){
            n--;
            cin>>op;
            if(op == "push"){
                cin>>x;
                stack[pos++] = x;
            }else if(op == "query"){
                if(pos == 0){
                    printf("Anguei!\n");
                }else{
                    printf("%llu\n",stack[pos-1]);
                }
            }else if(op == "pop"){
                if(pos == 0){
                    printf("Empty\n");
                }else{
                    stack[pos--] = 0;
                }
            }else{
                printf("%d\n",pos);
            }
        }
        memset(stack,0,sizeof(stack));
    }
    
    return 0;
}