#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

template<typename T>
class UnionFind {
    vector<T> parent;
    vector<T> rank;
public:
    UnionFind(T n) {
        init(n);
    }

    void init(T n) {
        parent.clear();
        rank.clear();
        for(int i=0; i<n; i++){
            parent.emplace_back(i);
            rank.emplace_back(0);
        }
    }

    int find(T x){
        if(parent[x] == x)
            return x;
        else
            return parent[x] = find(parent[x]);
    }

    void unite(T x, T y){
        x = find(x);
        y = find(y);
        if(x==y) return;
        if(rank[x] < rank[y]){
            parent[x] = y;
        } else {
            parent[y] = x;
            if(rank[x] == rank[y]) rank[x]++;
        }
    }

    bool same(T x, T y){
        return find(x) == find(y);
    }
};

const int N = 10e4+5;
int n;

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n;
    int bridges[N]={};
    UnionFind<int> uf(n);

    REP(i,n-1){
        int u,v;
        cin>>u>>v;
        bridges[u]++;
        bridges[v]++;
        uf.unite(u,v);
    }

    bool is_united = true;
    int root = uf.find(0);
    FOR(i,1,n){
        if(root != uf.find(i)){
            is_united = false;
            break;
        }
    }

    bool flg = false;
    int cnt = 0;
    if(!is_united) cnt+=1;
    REP(i,n){
        //DEBUG(bridges[i]);
        if(!flg&&bridges[i]==1){
            flg=true;
            cnt++;
        }
        else if(bridges[i]==0){
            cnt++;
        }

        if(cnt>=2){
            cout << "Alice" << endl;
            return 0;
        }
    }
    cout << "Bob" << endl;
    return 0;
}