import sys;sys.setrecursionlimit(10**9)
class UnionFind():
  def __init__(self,n):
    self.n=[-1]*n
    self.r=[0]*n
  def Find_Root(self,x):
    if self.n[x]<0:
      return x
    else:
      self.n[x]=self.Find_Root(self.n[x])
      return self.n[x]
  def Unite(self,x,y):
    x=self.Find_Root(x)
    y=self.Find_Root(y)
    if x==y:return
    elif self.r[x]>self.r[y]:
      self.n[x]+=self.n[y]
      self.n[y]=x
    else:
      self.n[y]+=self.n[x]
      self.n[x]=y
      if self.r[x]==self.r[y]:
        self.r[y]+=1
  def Root_Same(self,x,y):
    return self.Find_Root(x)==self.Find_Root(y)
  def Count(self,x):
    return -self.n[self.Find_Root(x)]
  def Is_Root(self,x):
    return self.Find_Root(x)==x
n=int(input())
u=UnionFind(n)
for i in range(n-1):
  a,b=map(int,input().split())
  u.Unite(a,b)
c=[]
for i in range(n):
  if u.Is_Root(i):c.append(i)
if len(c)==1:print("Bob")
elif len(c)==2:
  if u.Count(c[0])*u.Count(c[1])==0:print("Bob")
  else:print("Alice")
else:print("Alice")