N = int(input())
S = input()
print("Bob" if int("".join(["0" if S[i] == "A" else "1" for i in range(N)]),2)%3 == 0 else "Alice")

"""
def naive(S):
    import sys
    sys.setrecursionlimit(100)
    from functools import cache
    from itertools import product
    
    def change(S,l,r):
        ret = []
        for i in range(len(S)):
            if(l <= i < r):
                if(S[i] == "A"):
                    ret.append("B")
                else:
                    ret.append("A")
            else:
                ret.append(S[i])
        return "".join(ret)

    @cache
    def f(S):
        for l in range(len(S)):
            for r in range(l,len(S)):
                if(S[l:r+1] != "A" * (r-l) + "B"):continue
                new = change(S,l,r+1)
                if(g(new)):return True
        return False

    @cache
    def g(S):
        for l in range(len(S)):
            for r in range(l,len(S)):
                if(S[l:r+1] != "A" * (r-l) + "B"):continue
                new = change(S,l,r+1)
                if(not f(new)):return False
        return True

    return f(S)

for i in product(["A","B"],repeat=5):
    S = "".join(i)
    print(S, "🔶" if naive(S) else "🔷")
"""