#include<bits/stdc++.h>
   
using namespace std;
  
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define all(x) (x).begin(),(x).end()
#define Fixed fixed << setprecision(14)
#define int int64_t
using pii = pair<int,int>;
constexpr int INF  = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod = 1e9+7; 
constexpr int MOD = 998244353;
 
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
 
template <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;
template <class T> using max_heap = priority_queue<T>;
template <class A,class B> using umap = unordered_map<A,B>;
   
int gcd(int a,int b){ return b ? gcd(b,a % b) : a;}
int lcm(int a,int b){ return a / gcd(a,b) * b;}

struct UnionFind{
    vector<int> rank,par;
    UnionFind(int n){
        rank.resize(n,1);
        par.resize(n);
        for(int i = 0;i < n;++i){
            par[i] = i;
        }
    }
 
    int root(int node){
        if(par[node] == node) return node;
        else return (par[node] = root(par[node]));
    }
 
    bool same(int a,int b){
        return (root(a) == root(b));
    }
 
    int size(int node){
        return rank[root(node)];
    }
 
    void unite(int a,int b){
        int a_root = root(a),b_root = root(b);
        int a_size = rank[a_root],b_size = rank[b_root];
        if(a_root == b_root) return;
        if(a_size < b_size) swap(a_root,b_root);
        rank[a_root] += rank[b_root];
        par[b_root] = par[a_root];
    }
};

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    UnionFind uf(n+1);
    int island = n;
    vector<vector<int> > g(n);
    rep(i,n-1){
        int u,v;
        cin >> u >> v;
        island -= (uf.root(u) != uf.root(v));
        uf.unite(u,v);
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }

    if(island == 1) cout << "Bob\n";
    else if(island > 2) cout << "Alice\n";
    else{
        rep(i,n){
            if(g[i].size() == 1){
                return cout << "Alice\n",0;
            }
        }
        cout << "Bob\n";
    }

    return 0;
}