class Unionfind:
     
    def __init__(self,n):
        self.uf = [-1]*n
 
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        self.uf[x] += self.uf[y]
        self.uf[y] = x
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]

n = int(input())
uf = Unionfind(n)
count = [0]*n
for _ in range(n-1):
    u,v = map(int,input().split())
    uf.union(u,v)
    count[u] += 1
    count[v] += 1

if uf.size(0) == n:
    print("Bob")
    exit()

s = 0
for i in range(n):
    if uf.find(i) == i:
        s += 1
    if count[i] not in [0,2]:
        print("Alice")
        exit()
print("Bob" if s == 2 else "Alice")