#include<bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll=long long;
#define LNF 0x3f3f3f3f3f3f3f3f
#define INF 0x3f3f3f3f
template <class T> using Tree = tree<T, null_type, less<T>,rb_tree_tag, tree_order_statistics_node_update>;
#define pll pair<int,int>
void solve(void){
    ll n;
    cin>>n;
    std::vector<std::vector<int>> E(n+1);
    for(int i=1;i<n;i++){
        int x,y;
        cin>>x>>y;
        E[x].push_back(y);
        E[y].push_back(x);
    }
    if(n<=2){
        cout<<"Bob";
        return;
    }
    ll ans=0;
    for(int i=1;i<=n;i++){
        if(E[i].size()==1)ans++;
    }
    cout<<((ans%2==0)?"Alice":"Bob");
}
int main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int t=1;
    // cin>>t;
    while(t--)
    solve();
    return 0;
}