import sys

sys.setrecursionlimit(10 ** 6)


def input(): return sys.stdin.readline().rstrip('\n')


class DSU:
    def __init__(self, n):
        self.p = list(range(n))

    def find(self, x):
        if x == self.p[x]:
            return x
        self.p[x] = self.find(self.p[x])
        return self.p[x]

    def union(self, a, b):
        self.p[self.find(a)] = self.find(b)


def main():
    n = int(input())
    dsu = DSU(n)
    deg = [0] * n
    for _ in range(n - 1):
        u, v = map(int, input().split())
        deg[u] += 1
        deg[v] += 1
        dsu.union(u, v)
    if all(i in [0, 2] for i in deg):
        return 'Bob'
    if all(dsu.find(0) == dsu.find(i) for i in range(n)) and len(set(dsu.find(i) for i in range(n))) == 2:
        return 'Bob'
    return 'Alice'


if __name__ == '__main__':
    ret = main()
    if ret is not None:
        print(ret)