#include "bits/stdc++.h"
using namespace std;
typedef long long ll;

// UnionFind
class UnionFind {
private:
    vector<int> par;
public:
    UnionFind(int n) {
        par.resize(n, -1);
    }

    int root(int x) {
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }

    bool unite(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return false;
        if (size(rx) < size(ry)) swap(rx, ry);
        par[rx] += par[ry];
        par[ry] = rx;
        return true;
    }

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

    int size(int x) {
        return -par[root(x)];
    }
};

vector<vector<int>> G;

int main() {
    int n; cin >> n;
    G.resize(n);
    UnionFind uf(n);
    int ok = n;
    for (int i = 0; i < n - 1; i++) {
        int a, b; cin >> a >> b;
        G[a].push_back(b);
        G[b].push_back(a);
        if (uf.unite(a, b)) ok--;
    }
    if (ok == 1) puts("Bob");
    else {
        if (ok == 2) {
            for (int i = 0; i < n; i++) {
                if (G[i].size() != 2 && G[i].size() != 0) {
                    puts("Alice");
                    return 0;
                }
            }
            puts("Bob");
            return 0;
        }
        puts("Alice");
    }
    return 0;
}