from collections import Counter
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)


class UF_tree:
    def __init__(self, n):
        self.root = [-1] * (n + 1)  # -1ならそのノードが根,で絶対値が木の要素数
        self.rank = [0] * (n + 1)

    def find(self, x):  # xの根となる要素番号を返す
        if self.root[x] < 0:
            return x
        else:
            self.root[x] = self.find(self.root[x])
            return self.root[x]

    def isSame(self, x, y):
        return self.find(x) == self.find(y)

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        elif self.rank[x] < self.rank[y]:
            self.root[y] += self.root[x]
            self.root[x] = y
        else:
            self.root[x] += self.root[y]
            self.root[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1

    def getNodeLen(self, x):
        return -self.root[self.find(x)]


if __name__ == "__main__":
    N = int(input())
    uf = UF_tree(N)
    edge = [0] * N
    for _ in range(N-1):
        a, b = map(int, input().split())
        edge[a] += 1
        edge[b] += 1
        uf.unite(a, b)

    island = set([uf.find(x) for x in range(N)])
    if len(island) == 1:
        print("Bob")
    elif len(island) >= 3:
        print("Alice")
    else:
        c = Counter(edge)
        if c[2] == N - 1:  # 1つ輪っかと1つの島だと連接にできる
            print("Bob")
        else:
            print("Alice")