def uf_find(n,p):

    ufl = []

    while p[n] != n:
        ufl.append(n)
        n = p[n]

    for i in ufl:
        p[i] = n

    return n


def uf_union(a,b,p,rank):

    ap = uf_find(a,p)
    bp = uf_find(b,p)

    if ap == bp:
        return True
    else:

        if rank[ap] > rank[bp]:
            p[bp] = ap
        elif rank[ap] < rank[bp]:
            p[ap] = bp
        else:
            p[bp] = ap
            rank[ap] += 1

        return False

N = int(input())

p = [i for i in range(N)]
rank = [1] * N
dic = {}

for i in range(N-1):

    u,v = map(int,input().split())
    uf_union(u,v,p,rank)

    if v not in dic:
        dic[v] = []
    if u not in dic:
        dic[u] = []

    dic[v].append(u)
    dic[u].append(v)

num = 0

for i in range(N):

    if i == uf_find(i,p):
        num += 1

if num >= 3:
    print ("Alice")
elif num == 1:
    print ("Bob")
else:

    t = 0

    for i in dic:
        
        if len(dic[i]) == 2:
            t += 1

    if t == N-1:
        print ("Bob")
    else:
        print ("Alice")