def find(x):
  if tree[x]<0:
    return x
  tree[x]=find(tree[x])
  return tree[x]
  
def unite(x,y):
  x=find(x)
  y=find(y)
  if x==y:
    return
  if tree[x]>tree[y]:
    x,y=y,x
  tree[x]+=tree[y]
  tree[y]=x
  
n=int(input())
tree=[-1]*n

g=[0]*n

for _ in range(n-1):
  a,b=map(int,input().split())
  g[a]+=1
  g[b]+=1
  unite(a,b)
  
cnt=[]
for i in range(n):
  if tree[i]<0:
    cnt.append(i)
    
if len(cnt)==1:
  print('Bob')
elif len(cnt)>2:
  print('Alice')
else:
  q=[g[cnt[0]],g[cnt[1]]]
  if 0 not in q:
    print('Alice')
    exit()
  if q[0]==0:
    s=cnt[1]
  else:
    s=cnt[0]
  bool=True
  for i in range(n):
    if find(i)==s:
      if g[i]!=2:
        bool=False
  if bool:
    print('Bob')
  else:
    print('Alice')