class UnionFind:
  def __init__(self, n):
    self.p = [-1]*n
    # union by rank
    self.r = [1]*n
 
  def find(self, x):
    if self.p[x] < 0:
      return x
    else:
      self.p[x] = self.find(self.p[x])
      return self.p[x]

  def union(self, x, y):
    rx, ry = self.find(x), self.find(y)

    if rx != ry:
      if self.r[rx] > self.r[ry]:
        rx, ry = ry, rx
      if self.r[rx] == self.r[ry]:
        self.r[ry] += 1
      self.p[ry] += self.p[rx]
      self.p[rx] = ry

  def same(self, x, y):
    return self.find(x) == self.find(y)

  def count_member(self, x):
    return -self.p[self.find(x)]

n=int(input())
uf=UnionFind(n)
edge=[0]*n
for i in range(n-1):
  u,v=map(int,input().split())
  uf.union(u,v)
  edge[u]+=1
  edge[v]+=1
c=[0]*n
for i in range(n):
  c[i]=uf.count_member(i)
c=set(c)

from collections import Counter

if len(c)==1:
  print("Bob")
elif len(c)>=3:
  print("Alice")
else:
  c=Counter(edge)
  if c[2]==n-1:
    print("Bob")
  else:
    print("Alice")