import java.util.Scanner;
import java.util.ArrayList;
import java.util.ArrayDeque;

public class Main {
    public static void main(String[] args) {
        new Main();
    }
    
    public Main() {
        try (Scanner sc = new Scanner(System.in)) {
            int N = sc.nextInt();
            ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
            for (int i = 0;i < N;++ i) graph.add(new ArrayList<>());
            int check = 0;
            for (int i = 1;i < N;++ i) {
                int u = sc.nextInt(), v = sc.nextInt();
                check = u;
                graph.get(u).add(v);
                graph.get(v).add(u);
            }
            ArrayDeque<Integer> bfs = new ArrayDeque<>();
            boolean[] reach = new boolean[N];
            bfs.addLast(check);
            reach[check] = true;
            int count = 1;
            while(!bfs.isEmpty()) {
                int tmp = bfs.removeFirst();
                for (int i : graph.get(tmp)) {
                    if (!reach[i]) {
                        reach[i] = true;
                        bfs.addLast(i);
                        ++ count;
                    }
                }
            }
            boolean cycleCheck = true;
            for (ArrayList<?> i : graph) cycleCheck &= i.size() == 2;
            if (cycleCheck) ++ count;
            System.out.println(count < N ? "Alice" : "Bob");
        }
    }
}