#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, r) for(int i = 0; i < (r); ++i)
#define reps(i, s, r) for(int i = (s); i < (r); ++i)
#define fore(i, m2) for(auto &i : m2)
#define vi vector<int>
#define vl vector<ll>
#define pl pair<ll, ll>
#define all(i) (i).begin(), (i).end()
#define fs first
#define sc second

template <class T> bool chmin(T &i, T b) {
    if(i > b) {
        i = b;
        return true;
    }
    return false;
}
template <class T> bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

const ll INF = LONG_LONG_MAX / 3;
const ll MOD = 1'000'000'007;
const ll MAX = 1e3 + 5;

class unionFind {
  public:
    vi rank, p;

    unionFind() {}
    unionFind(int size) {
        rank.resize(size, 0);
        p.resize(size, 0);
        rep(i, size) makeSet(i);
    }

    void makeSet(int x) {
        p[x] = x;
        rank[x] = 0;
    }

    bool same(int x, int y) { return root(x) == root(y); }

    void unite(int x, int y) { link(root(x), root(y)); }

    void link(int x, int y) {
        if(rank[x] > rank[y]) {
            p[y] = x;
        } else {
            p[x] = y;
            if(rank[x] == rank[y]) {
                rank[y]++;
            }
        }
    }
    int root(int x) {
        if(x != p[x]) {
            p[x] = root(p[x]);
        }
        return p[x];
    }
};

int main() {

    ll n;
    cin >> n;

    unionFind uf(n);
    ll u, v;
    rep(i, n - 1) {
        cin >> u >> v;
        uf.unite(u, v);
    }

    bool res = true;

    rep(i, n - 1) {
        if(uf.root(i) != uf.root(i + 1))
            res = false;
    }

    if(res)
        cout << "Bob" << endl;
    else
        cout << "Alice" << endl;
}