#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n)                                                           \
    vl v;                                                                      \
    rep(i, n) {                                                                \
        ll x;                                                                  \
        cin >> x;                                                              \
        v.push_back(x);                                                        \
    }
bool chmin(ll& a, ll& b) { if (b < a) { a = b; return 1; } return 0; }
bool chmax(ll& a, ll& b) { if (b > a) { a = b; return 1; } return 0; }
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans;
vl V;
struct Gragh {
    ll N;
    vector<vl> G;
    vl visited;

    Gragh(ll n) {
        N = n;
        G.resize(N);
        resetv();
    }

    void add(ll a, ll b) { G[a].push_back(b); }

    void resetv(void) { visited = vl(N, 0); }

    //重さ無し
    void dfs(ll x, ll a) {
        visited[x] = 1;
        ans = max(ans, a);
        for (ll i : G[x]) {
            if (visited[i] == 0) {
                dfs(i, a + 1);
            }
        }
    }
};
int main() {
    cin >> n;
    Gragh G(n);
    rep(i, n - 1) {
        cin >> a >> b;
        G.add(a, b);
        G.add(b, a);
    }

    rep(i, n) {
        if (!G.visited[i]) {
            G.dfs(i, 0);
            k++;
        }
    }

    sort(all(V));
    reverse(all(V));

    if (k > 2) {
        cout << "Alice" << endl;
    }
    else if (k == 2 && ans!= n - 2) {
        cout << "Alice" << endl;
    }
    else {
        cout << "Bob" << endl;
    }
}