class UnionFind: def __init__(self, n: int): self.data = [-1] * (n+1) self.nexts = [i for i in range(n+1)] def root(self, a: int) -> int: if self.data[a] < 0: return a self.data[a] = self.root(self.data[a]) return self.data[a] def unite(self, a: int, b: int) -> bool: pa = self.root(a) pb = self.root(b) if pa == pb: return False if self.data[pa] > self.data[pb]: pa, pb = pb, pa self.data[pa] += self.data[pb] # pa を pb をつなげる self.data[pb] = pa self.nexts[pa], self.nexts[pb] = self.nexts[pb], self.nexts[pa] return True def issame(self, a: int, b: int) -> bool: return self.root(a) == self.root(b) def size(self, a: int) -> int: """a が属する集合のサイズ""" return -self.data[self.root(a)] def group(self, a: int): """a が属する集合""" yield a x = a while self.nexts[x] != a: x = self.nexts[x] yield x N = int(input()) uf = UnionFind(N) degs = [0] * N for _ in range(N-1): u, v = map(int, input().split()) degs[u] += 1 degs[v] += 1 uf.unite(u, v) s = set(uf.root(i) for i in range(N)) if uf.size(0) == N or len(s) <= 2 and 1 not in degs: print('Bob') else: print('Alice')