import sys
sys.setrecursionlimit(200000)

def dfs(goto, u, v, now=0):
    for i in range(n-1):
        if u[i] == now and not goto[v[i]]:
            goto[v[i]] = True
            return dfs(goto, u, v, v[i])
        elif v[i] == now and not goto[u[i]]:
            goto[u[i]] = True
            return dffs(goto, u, v, u[i])
    return goto

n = int(input())
goto = [False for i in range(n)]
goto[0] = True
u, v = [], []

for i in range(n - 1):
    te, mp = map(int, input().split())
    u.append(te), v.append(mp)

goto = dfs(goto, u, v)
print('Bob' if len(list(filter(lambda x: not x, goto))) == 0 else 'Alice')