import sys, math
sys.setrecursionlimit(10**5 + 10)

def input():
    return sys.stdin.readline()[:-1]

def main():
    N = int(input())
    G = [[] for k in range(N)]
    F = [0 for k in range(N)]
    for k in range(N-1):
        u, v = map(int,input().split())
        G[u].append(v)
        G[v].append(u)
        F[u] += 1
        F[v] += 1
    V = [0 for k in range(N)]
    def dfs(ima):
        for e in G[ima]:
            if V[e] == 0:
                V[e] = 1
                dfs(e)
    dfs(0)
    if V.count(1) == N or (V.count(1) == N-1 and F.count(2) == N-1):
        print("Bob")
    else:
        print("Alice")

if __name__ == '__main__':
    main()