import sys
from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

memo = {}
def calc(a,b,c,d,which,goal,now):
    if (a,b,c,d,which,goal,now) in memo:
        return memo[a,b,c,d,which,goal,now]
    
    assert a+b == c+d
    if a+b == 0:
        if now == goal:
            return "Alice"
        else:
            return "Bob"
    
    res = "Alice" if which == "Bob" else "Bob"
    nxt = "Alice" if which == "Bob" else "Bob"

    if a and c and calc(a-1,b,c-1,d,nxt,goal,now^1) == which:
        res = which
    if a and d and calc(a-1,b,c,d-1,nxt,goal,now) == which:
        res = which
    if b and c and calc(a,b-1,c-1,d,nxt,goal,now) == which:
        res = which
    if b and d and calc(a,b-1,c,d-1,nxt,goal,now) == which:
        res = which
    
    memo[a,b,c,d,which,goal,now] = res
    return res



def solve_even(N):
    p_cnt = 0
    for i in range(100):
        if (N-1)>>i & 1:
            p_cnt += 1
    
    check = N - (1<<p_cnt)
    if check == 0 or check & 1 == 1:
        return "Alice"
    else:
        return "Bob"
    
def solve_odd(N):
    p_cnt = 0
    for i in range(100):
        if (N-1)>>i & 1:
            p_cnt += 1
    
    check = N - (1<<p_cnt)
    if check & 1 == 1:
        return "Alice"
    else:
        return "Bob"
    
def solve(N,S):
    if S == "Even":
        return solve_even(N)
    else:
        return solve_odd(N)
    
def solve_brute(N,S):
    if S == "Even":
        p_cnt = 0
        for i in range(100):
            if (N-1)>>i & 1:
                p_cnt += 1
        a = 1<<p_cnt
        b = N - a
        c = (N+1)//2
        d = N - c
        return calc(a,b,c,d,"Alice",0,0)
    else:
        p_cnt = 0
        for i in range(100):
            if (N-1)>>i & 1:
                p_cnt += 1
        a = 1<<p_cnt
        b = N - a
        c = (N+1)//2
        d = N - c
        return calc(a,b,c,d,"Alice",1,0)
    
#for N in range(3,100):
    #for S in ["Even","Odd"]:
        #print(N,S)
        #assert solve(N,S) == solve_brute(N,S)
    
for _ in range(int(input())):
    N,S = input().split()
    N = int(N)

    if N <= 2:
        print(solve_brute(N,S))
    else:
        print(solve(N,S))
    #print(solve(N,S),solve_brute(N,S))