#unionfind経路圧縮あり
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = list(range(n))

    def find(self, x):
        if self.parents[x] == x:
            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 self.parents[x] > self.parents[y]:
            x, y = y, x
            
        if x == y:
            return

        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 == i]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
import sys
import collections
N = int(input())
#全連結すなわち木ならBob
#N-1の円環ループ＋１頂点ならBob
#それ以外Alice
lsg = [[] for i in range(N)]
UF = UnionFind(N)
for i in range(N-1):
    u,v = map(int,input().split())
    lsg[u].append(v)
    lsg[v].append(u)
    UF.union(u,v)
if len(UF.roots()) == 1:
    print('Bob')
    sys.exit()
if len(UF.roots()) >= 3:
    print('Alice')
    sys.exit()
lsn = [0]*(N)
for i in range(N):
    lsn[i] = len(lsg[i])
if lsn.count(0) == 1 and lsn.count(2) == N-1:
    print('Bob')
else:
    print('Alice')