#include<bits/stdc++.h>

#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

/////////////////////////////////////////////////////
ll N;
vector<ll> uvv[101010];
ll mk[101010];
ll i, j, k,ans;
//Union木
struct UnionFind{
    vector<int> nxt;
    void init(int x){
        nxt.clear();
        nxt.resize(x);
        for (int i = 0; i < x;i++){
            nxt[i] = i;
        }
    }
    int find(int x){
        if(nxt[x]==x)
            return x;
        return nxt[x] =find(nxt[x]);
    }
    inline void unite(int x,int y){
        nxt[find(y)] = find(x);
    }
};

ll bfs(ll a){
    mk[a] = 1;
    ll c = 1;
    fornum(i,0,uvv[a].size()){
        ll b = uvv[a][i];
        if(mk[b])
            continue;
        c += bfs(b);
    }
    return c;
}

int main(){
    scanf("%lld", &N);
    UnionFind uf;
    uf.init(N);
    fornum(i,1,N){
        ll u, v;
        scanf("%lld%lld", &u, &v);
        uvv[u].push_back(v);
        uvv[v].push_back(u);
        uf.unite(u, v);
    }
    ll a = 0;
    ll b = -1;
    fornum(i,0,N){
        if(uf.find(i)==i){
            a++;
        }
    }
    //printf("%lld %lld %lld\n",a,b, i);
    if(a>2){
        printf("Alice");
    }else if(a==1){
        printf("Bob");
    }else{
        fornum(i,0,N){
            if(uf.find(i)==i){
                ll a = bfs(i);
                if(a!=N-1&&a!=1)
                    break;
            }
        }
        if(i==N){
            printf("Bob");
        }else{
            printf("Alice");
        }
    }
    

    return 0;
}