#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
vector<int> adj[505];
int depth[505];
void dfs(int node, int pre, int d){
	depth[node]=d;
	for(int i: adj[node]){
		if(i!=pre){
			dfs(i,node,d+1);
		}
	}
}
signed main(){
	int n;
	cin>>n;
	for(int i=0; i<n-1; i++){
		int u,v;
		cin>>u>>v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	for(int i=1; i<=n; i++){
		for(int j=0; j<=100; j++){
			depth[i]=0;
		}
		dfs(i,0,0);
		int cnt=0;
		for(int j=1; j<=n; j++){
			if(depth[j]>=2) cnt++;
		}
		if(cnt%2==1){
			cout<<"Alice"<<endl;
			return 0;
		}
	}
	cout<<"Bob"<<endl;
}