#include <bits/stdc++.h>
using namespace std;

bool dfs(const vector<vector<int>> &to, vector<bool> &isvisited, int index, int prev) {
    isvisited.at(index) = true;
    for (int next : to.at(index)) {
        if (next == prev) continue;
        if (isvisited.at(next)) return false;
        if (dfs(to, isvisited, next, index) == false) return false;
    }
    return true;
}

int main() {
    int n;
    cin >> n;
    vector<vector<int>> to(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        to.at(u).push_back(v);
        to.at(v).push_back(u);
    }
    for (int i = 0; i < n; i++) {
        if (to.at(i).size() != 2 && to.at(i).size() != 0) break;
        if (i == n - 1) {
            cout << "Bob" << endl;
            return 0;
        }
    }
    vector<bool> isvisited(n);
    for (int i = 0; i < n; i++) {
        if (isvisited.at(i)) continue;
        if (!dfs(to, isvisited, i, -1)) {
            cout << "Alice" << endl;
            return 0;
        }
    }
    cout << "Bob" << endl;
}