class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

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

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

n = int(input())
uf = UnionFind(n)

for i in range(n-1):
    a, b = map(int, input().split())
    uf.union(a,b)
    # print(uf.parents)
# print(uf.parents)
cluster_num = sum([1 for p in uf.parents if p < 0])
# print(cluster_num)
if cluster_num >= 2:
    print("Alice")
else:
    print("Bob")