#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<bool> visited(n, false);
    vector<int64> visit(n, 0);
    queue<P> q;
    q.emplace(-1,0);
    visit[0]++;

    while(!q.empty()) {
        auto [v, u] = q.front(); q.pop();
        if (visited[u]) continue;
        visited[u] = true;

        for (auto vi : g[u]) {
            if (vi == v) continue;
            visit[vi]++;
            q.emplace(u, vi);
        }
    }
    return visit;
}

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);
    sort(v.begin(), v.end());
    bool ans = all_of(v.begin(), v.end(), [](int x){return x>0;});
    auto it = lower_bound(v.begin(), v.end(), 2);
    ans = ans || (it - v.begin()) <= 1;


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