#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000

struct unionfind{
	vector<int> data;
	vector<int> size;
	unionfind(int n){
		for(int i=0;i<n;i++){
			data.push_back(i);
			size.push_back(1);
		}
	}
	
	int find(int x){
		if(data[x]==x)return x;
		return data[x]=find(data[x]);
	}
	
	bool unite(int x,int y){
		x=find(x);y=find(y);
		if(x==y)return false;
		data[x]=y;
		size[y]+=size[x];
		return true;
	}
	
	bool check(int x,int y){
		return (find(x)==find(y));
	}
	
	int get_size(int x){
		int X = find(x);
		return size[X];
	}
};

int main(){
	
	int N;
	cin>>N;
	
	unionfind uf(N);
	
	vector<int> jisuu(N,0);
	
	for(int i=0;i<N-1;i++){
		int a,b;
		cin>>a>>b;
		
		uf.unite(a,b);
		
		jisuu[a]++;
		jisuu[b]++;
	}
	
	if(uf.get_size(0)==N){
		cout<<"Bob"<<endl;
	}
	else{
		set<int> S1;
		set<int> S2;
		for(int i=0;i<N;i++){
			S1.insert(uf.get_size(i));
			S2.insert(jisuu[i]);
		}
		
		if(S1.size()==2&&S1.count(1)&&S1.count(N-1)&&S2.size()==2&&S2.count(2)&&S2.count(0)){
			cout<<"Bob"<<endl;
		}
		else{
			cout<<"Alice"<<endl;
		}
	}
	
	return 0;
}