#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,M,Q;
bool G[SIZE];
set<int> E[SIZE];

void solve() {
    cin>>N;
    int u,v;
    REP(i,N-1) {
        cin>>u>>v;
        E[u].insert(v);
        E[v].insert(u);
    }
    queue<int> que;
    que.push(0);
    G[0] = 1;
    while(que.size()) {
        int i = que.front();
        que.pop();
        for (int to:E[i]) {
            if (!G[to]) {
                G[to] = 1;
                que.push(to);
            }
        }
    }
    int ok = true;
    REP(i,N) if (!G[i]) {
        ok = false;
        break;
    }
    
    cout << (ok ? "Bob" : "Alice") << endl;
}