class UnionFind: def __init__(self, size): self.data = [-1] * size def find(self, x): if self.data[x] < 0: return x else: self.data[x] = self.find(self.data[x]) return self.data[x] def union(self, x, y): x, y = self.find(x), self.find(y) if x != y: if self.data[y] < self.data[x]: x, y = y, x self.data[x] += self.data[y] self.data[y] = x return (x != y) def same(self, x, y): return (self.find(x) == self.find(y)) def size(self, x): return -self.data[self.find(x)] N, *AB = map(int, open(0).read().split()) uf = UnionFind(N) E = [[] for _ in range(N)] for a, b in zip(*[iter(AB)] * 2): E[a].append(b) E[b].append(a) uf.union(a, b) one = sum(1 for e in E if len(e) == 1) C = len(set(uf.find(i) for i in range(N))) if C == 1 or (C == 2 and one == 0): print("Bob") else: print("Alice")