#include <bits/stdc++.h>

using namespace std;

#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define MOD 1000000007
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)

map<lli,vector<lli>> d;
lli branch[100100];
lli data[100100];
bool allTwo;
void dfs(lli from){
	if(data[from])return;
	if(branch[from]<2){
		allTwo=false;
	}
	data[from]=1;
	for(auto e:d[from]){
		dfs(e);
	}
}

signed main(){

	lli n;
	cin>>n;
	lli two=0;
	lli one=0;
	lli zero;

	REP(i,0,n-1){
		lli u,v;
		cin>>u>>v;
		d[u].push_back(v);
		d[v].push_back(u);
		branch[u]++;
		branch[v]++;
	}

	REP(i,0,n){
		allTwo=true;
		if(data[i])continue;
		if(branch[i]==0){
			two++;
			continue;
		}
		dfs(i);
		if(allTwo)two++;
		else one++;
	}

	if(DEBUG)cout<<"one="<<one<<" two="<<two<<endl;

	if(one==0){
		if(two<=2)cout<<"Bob"<<endl;
		else cout<<"Alice"<<endl;
	}
	else if(one==1){
		if(two>0)cout<<"Alice"<<endl;
		else cout<<"Bob"<<endl;
	}
	else cout<<"Alice"<<endl;

	return 0;
}