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
    def size(self, x):
        return -self.parents[self.find(x)]
    def same(self, x, y):
        return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
        return len(self.roots())

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

link = [[] for _ in range(n)]
for i in range(n-1):
    tmp = list(map(int,input().split()))
    link[tmp[0]].append(tmp[1])
    link[tmp[1]].append(tmp[0])
    uf.union(tmp[0],tmp[1])

if uf.group_count() == 1:
    print("Bob")
    exit()
if uf.group_count() > 2:
    print("Alice")
    exit()


for i in range(len(link)):
    if len(link[i])!=0 and len(link[i])!=2:
        print("Alice")
        exit()
print("Bob")