#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <map>
#include <algorithm>
#include <queue>
#include <cmath>
#include <numeric>
#include <set>

using namespace std;
struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
#define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;}

using int64 = long long;
using P = pair<int,int>;

vector<int64> bfs(const vector<vector<int64>>& g) {
    int n = g.size();
    vector<int64> ans(n, -1);
    queue<P> q;
    q.emplace(0,0);

    while(!q.empty()) {
        auto [u, ni] = q.front(); q.pop();
        if (u == 0 && ni == n-1) {
            ans[0] = n-1;
            return ans;
        }
        if (ans[u] != -1) continue;
        ans[u] = ni;
        for (auto v : g[u]) {
            if (ni==n-1 && v == 0) ans[0] = n-1;
            else {
                q.emplace(v, ni+1);
            }
        }
    }
    return ans;
}

//void dfs(int64 u, int p,  int64 n, const vector<vector<int64>>& g, vector<bool>& visited, vector<int64>& path) {
//
//    if (visited[u]) return;
//
//    for(const auto& v : g[u]) {
//        if (v == p) continue;
//        dfs(v, u, n+1, g, visited, path);
//    }
//}

int main() {
    int64 n;
    cin >> n;
    vector<vector<int64>> g(n);

    if (n == 2) {
        cout << "Bob" << endl;
        return 0;
    }

    for (int i = 0; i < n - 1; i++) {
        int64 u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    vector<int64> v = bfs(g);
    bool ans = v[0] == n-1;
    ans = ans || any_of(v.begin(), v.end(), [&](int x){return x==n-1;});



    cout << (ans? "Bob" : "Alice") << endl;
}