class UnionFind:
    def __init__(self, n):
        self.parent = [i for i in range(n)]
    def find(self, x):
        if self.parent[x] == x:
            return x
        self.parent[x] = self.find(self.parent[x])
        return self.parent[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        self.parent[x] = y

def main():
    N = int(input())
    uf = UnionFind(N)
    for _ in range(N-1):
        u, v = map(int, input().split())
        uf.union(u, v)
    p = uf.find(0)
    bob = all(uf.find(i) == p for i in range(N))
    print('Bob' if bob else 'Alice')

main()