#include #include using mint = atcoder::static_modint<998244353>; //using mint = atcoder::static_modint<1000000007>; using namespace std; using namespace atcoder; using ld = long double; using ll = long long; #define mp(a,b) make_pair(a,b) #define rep(i,s,n) for(int i=s; i dx{1,0,-1,0},dy{0,1,0,-1}; template void compress(vector&a, bool is_unique=false){ auto b=a; sort(b.begin(),b.end()); if(is_unique){ auto p=unique(b.begin(),b.end()); b.erase(p,b.end()); } for(auto&x:a)x=lower_bound(b.begin(),b.end(),x)-b.begin(); } int main(){ int T; cin >> T; vector out; rep(t,0,T){ ll n; cin >> n; string s; cin >> s; if(n==1){ if(s=="Even")out.push_back("Bob"); else out.push_back("Alice"); } else if(n%4==0){ out.push_back("Bob"); } else if(n%4==1){ out.push_back("Alice"); } else if(n%4==2){ if(s=="Even")out.push_back("Bob"); else out.push_back("Alice"); } else out.push_back("Alice"); } for(auto x:out)cout << x << "\n"; }