from collections import deque
n=int(input())
e=[[] for _ in range(n)]
for i in range(n-1):
  a,b=map(int,input().split())
  a-=1
  b-=1
  e[a].append(b)
  e[b].append(a)
seen=[0]*n
seen[0]=1
stack=deque([0])
while stack:
  u=stack.pop()
  for v in e[u]:
    if seen[v]!=1:
      seen[v]=1
      stack.append(v)
if sum(seen)==n:
  print('Bob')
else:
  print('Alice')