import collections

def solve(A, data):
    counter = collections.Counter()

    for d in data:
        t = ("e" if d[0] % 2 == 0 else "o") + ("e" if d[1] % 2 == 0 else "o")
        counter.update([t])

    availcount = 0
    for v in counter.values():
        availcount += v // 2

    return "Bob" if availcount % 2 == 0 else "Alice"


if __name__ == '__main__':
    N = (int)(input())
    d = []
    for _ in range(0, N):
        d.append(list(map(int, input().split())))
    print(solve(N, d))