#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

// union-find tree with size(struct)
struct UnionFind{
    vector<int> par; // 親ノード
    vector<int> rank; // ランク
	vector<int> size; // 連結成分のサイズ

    UnionFind(int n = 1) {
        init(n);
    }

    void init(int n = 1) {
        par.resize(n);
		rank.resize(n);
		size.resize(n);
        for (int i = 0; i < n; ++i){
			par[i] = i;
			rank[i] = 0;
			size[i] = 1;
		}
    }

    int find(int x) {
        if (par[x] == x)  return x;

        int r = find(par[x]);
        return par[x] = r;
    }

    bool issame(int x, int y) {
        return find(x) == find(y);
    }

    bool unite(int x, int y) {
	    x = find(x);
		y = find(y);
	    if (x == y) return false;

	    if (rank[x] < rank[y]) swap(x, y);
	    if (rank[x] == rank[y]) ++rank[x];
	    par[y] = x;
		size[x] += size[y];
	    return true;
    }

	int getSize(int x){
		return size[find(x)];
	}

	int getRank(int x){
		return rank[find(x)];
	}
};

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	int n;
	cin >> n;

	UnionFind uf(n);
	vector<int> sz(n, 0);
	rep(i, n-1){
		int u, v;
		cin >> u >> v;
		uf.unite(u, v);
		sz[u]++;
		sz[v]++;
	}

	set<int> pars;
	rep(i, n) pars.insert(uf.find(i));
	if(pars.size() == 1){
		cout << "Bob" << endl;
	}else if(pars.size() >= 3){
		cout << "Alice" << endl;
	}else{
		int zero = 0;
		bool two = true;
		rep(i, n){
			if(sz[i] == 0) zero++;
			else if(sz[i] != 2) two = false;
		}

		if(zero == 1 && two){
			cout << "Bob" << endl;
		}else{
			cout << "Alice" << endl;
		}
	}
}