#include <bits/stdc++.h>
using namespace std;

struct UnionFind{
    vector<int> tree;

    UnionFind(int n): tree(n+1, -1) {};

    int root(int i){ return tree[i] < 0 ? i : tree[i] = root(tree[i]); }

    bool unite(int i, int j){
        i = root(i), j = root(j);
        if(i == j) return false;
        tree[i] += tree[j], tree[j] = i;
        return true;
    }

    bool same(int i, int j){ return root(i) == root(j); }

    int size(int i){ return -tree[root(i)]; }
};

int main(){
    int n;
    cin >> n;

    UnionFind uf(n);


    int cnt[100010];

    for(int i = 0;i < n-1;i++){
        int a, b; cin >> a >> b;
        cnt[a]++;
        cnt[b]++;

        uf.unite(a, b);
    }

    map<int, int> mp;

    for(int i = 0;i < n;i++){
        mp[uf.root(i)]++;
    }

    if(mp.size() > 2){
        cout << "Alice" << endl;
    }else if(mp.size() == 1){
        cout << "Bob" << endl;
    }else{

        for(int i = 0;i < n;i++){
            if(!(cnt[i] == 2 || cnt[i] == 0)){
                cout << "Alice" << endl;
                return 0;
            }
        }

        cout << "Bob" << endl;
    }

    return 0;
}