#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;

int n = 100005;
vector<vector<int>> graph(n,vector<int>());
vector<bool> visited(n,false);

void dfs(int i,int before){
    visited[i] = true;
    for(int p:graph[i]){
        if(p == before) continue;
        if(!visited[p]) dfs(p,i);
    }
}


int main() {
    cin >> n;
    rep(i,n-1){
        int a,b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    int cnt = 0;
    rep(i,n){
        if(!visited[i]){
            dfs(i,-1);
            cnt ++;
        }
    }

    if(cnt == 1){
        cout << "Bob" << endl;
        return 0;
    }
    else if(cnt >= 3){
        cout << "Alice" << endl;
        return 0;
    }
    else{
        rep(i,n){
            if(graph[i].size() == 1){
                cout << "Alice" << endl;
                return 0;
            }
        }
    }

    cout << "Bob" <<endl;
    return 0;

    
}