N = int(input())

import sys
sys.setrecursionlimit(10**6)

class UnionFind():
  def __init__(self, n):
    self.par = [i for i in range(n)]

  def root(self, x):
    if self.par[x] == x:
      return x
    else:
      self.par[x] = self.root(self.par[x])
      return self.par[x]
  
  def unite(self, x, y):
    x = self.root(x)
    y = self.root(y)
    self.par[y] = x

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

uf = UnionFind(N)
for i in range(N-1):
  u, v = map(int, input().split())
  uf.unite(u, v)

ans = set()
for i in range(N):
  ans.add(uf.root(i))
print("Alice" if len(ans) > 1 else "Bob")