def main():
    import sys
    input = sys.stdin.readline

    # 単純に橋となる辺を返す
    def bridge(G, N):
        result = set()
        label = [None] * N
        gen = 0
        cost = [0] * N

        def dfs(u, p):
            nonlocal gen
            res = 0
            for v in G[u]:
                if v == p:
                    continue
                if label[v] is not None:
                    if label[v] < label[u]:
                        cost[v] += 1
                        res += 1
                else:
                    label[v] = gen;
                    gen += 1
                    r = dfs(v, u)
                    if r == 0:
                        result.add((u, v) if u < v else (v, u))
                    res += r
            res -= cost[u]
            return res

        for v in range(N):
            if not label[v]:
                label[v] = gen;
                gen += 1
                r = dfs(v, -1)
                assert r == 0, r
        return result

    N = int(input())
    adj = [[] for _ in range(N)]
    for _ in range(N-1):
        u, v = map(int, input().split())
        adj[u].append(v)
        adj[v].append(u)
    cnt_0 = 0
    for i in range(N):
        if len(adj[i]) == 0:
            cnt_0 += 1

    flg = len(bridge(adj, N))
    
    if cnt_0 >= 2:
        print('Alice')
    elif cnt_0 == 1 and flg:
        print('Alice')
    else:
        print('Bob')


if __name__ == '__main__':
    main()