N=int(input())
P=[i for i in range(N)]
S=[1 for i in range(N)]

def find(a):
    if a==P[a]:
        return a
    else:
        return find(P[a])
        
def union(b,c):
    B=find(b)
    C=find(c)
    if S[B]<S[C]:
        P[B]=P[C]
        S[C]+=S[B]
    else:
        P[C]=P[B]
        S[C]+=S[B]

for i in range(N-1):
    a,b=map(int,input().split())
    if find(a)!=find(b):
        union(a,b)
        
for i in range(N):
    P[i]=find(i)

for i in range(1,N):
    if P[0]!=P[i]:
        print("Alice")
        exit()
print("Bob")