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)

from collections import defaultdict
n = int(input())
d = defaultdict(list)
uf = UnionFind(n)
for i in range(n-1):
    u, v = map(int, input().split())
    d[u].append(v)
    d[v].append(u)
    uf.union(u, v)

if uf.size(0) == n:
    print("Bob")
else:
    if uf.size(0) == n-1 or uf.size(1) == n-1:
        for i in range(n):
            if len(d[i]) >= 3:
                print("Alice")
                exit()
        print("Bob")
    else:
        print("Alice")