n= int(input())
graph = [[] for i in range(n+1)]
for i in range(n-1):
  a,b = map(int,input().split())
  graph[a].append(b)
  graph[b].append(a)

from collections import deque
que = deque([0])
depth = [-1]*(n+1)
depth[0] = 0
while que:
  crr = que.popleft()
  for nxt in graph[crr]:
    if depth[nxt] ==  -1:
      depth[nxt] = depth[crr]+1
      que.append(nxt)
    

flg = 1

for i in range(n):
  flg &= (depth[i] != -1)

if flg:
  print("Bob")
else:
  print("Alice")