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


class UnionFind{
public:
	vector<int> par,siz;
	UnionFind(int n_){init(n_);}
	void init(int n = 1) {
		siz.resize(n,1);
		par.resize(n);
		for (int i = 0; i < n; ++i) par[i] = i;
	}
	int root(int x = 1){
		if(par[x]==x)return x;
		return par[x] = root(par[x]);
	}
	void unite(int x = 1,int y = 1){
		x = root(x);
		y = root(y);
		if(x==y)return;
		siz[y] += siz[x];
		siz[x] = 0;
		par[x] = y;
	}
	int size(int x){
		return siz[root(x)];
	}
};


int main(){
	ll N,u,v;
	cin >> N;
	UnionFind uf(N);
	for (int i = 0; i < N-1; ++i){
		cin >> u >> v;
		uf.unite(u,v);
	}
	if(uf.size(0)==N){
		cout << "Bob" << endl;
	}else{
		cout << "Alice" << endl;
	}
}