#pragma comment (linker, "/STACK:526000000")
#define  _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"

using namespace std;
typedef string::const_iterator State;
#define eps 1e-11L
#define MAX_MOD 1000000007LL
#define GYAKU 500000004LL

#define MOD 998244353LL
#define seg_size 262144
#define pb push_back
#define mp make_pair
typedef long long ll;
#define REP(a,b) for(long long (a) = 0;(a) < (b);++(a))
#define ALL(x) (x).begin(),(x).end()
unsigned long xor128() {
    static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned long t = (x ^ (x << 11));
    x = y; y = z; z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
void init() {
    iostream::sync_with_stdio(false);
    cout << fixed << setprecision(100);
}
#define int ll
pair<int,int> union_tree[300000];
int union_find(int now) {
    if (union_tree[now].first == now) return now;
    return union_tree[now].first = union_find(union_tree[now].first);
}
int union_merge(int a, int b) {
    a = union_find(a);
    b = union_find(b);
    if (a != b) {
        union_tree[a].first = b;
        union_tree[b].second += union_tree[a].second;
    }
    return 0;
}
void solve(){
    int n;
    cin >> n;
    REP(i, n) {
        union_tree[i] = mp(i, 1);
    }
    REP(i, n - 1) {
        int a, b;
        cin >> a >> b;
        union_merge(a, b);
    }
    map<int,int> go;
    REP(i, n) {
        go[union_find(i)] = 1;
    }
    if (go.size() == 1) {
        cout << "Bob" << endl;
        return;
    }
    else if (go.size() == 2) {
        for (auto x : go) {
            if (union_tree[x.first].second == 1) {
                cout << "Bob" << endl;
                return;
            }
        }
    }
    cout << "Alice" << endl;
    return;
}
#undef int
int main() {
    init();
    solve();
}