#include<iostream>
using namespace std;
#include<vector>
struct UF{
	int n;
	vector<int>parent,rank;
	UF(int n_=0):n(n_),parent(n_),rank(n_,1)
	{
		for(int i=0;i<n_;i++)parent[i]=i;
	}
	int find(int a){return parent[a]!=a?parent[a]=find(parent[a]):a;}
	bool same(int a,int b){return find(a)==find(b);}
	bool unite(int a,int b)
	{
		a=find(a),b=find(b);
		if(a==b)return false;
		if(rank[a]<rank[b])
		{
			parent[a]=b;
			rank[b]+=rank[a];
		}
		else
		{
			parent[b]=a;
			rank[a]+=rank[b];
		}
		return true;
	}
	int size(int a){return rank[find(a)];}
};
int N;
int sz[1<<17];
main()
{
	cin>>N;
	int cnt=N-1;
	UF uf(N);
	for(int i=1;i<N;i++)
	{
		int u,v;cin>>u>>v;
		cnt-=uf.unite(u,v);
		sz[u]++;sz[v]++;
	}
	if(cnt==0)cout<<"Bob"<<endl;
	else
	{
		int now=0;
		for(int i=0;i<N;i++)now+=sz[i]!=2;
		cout<<(cnt==1&&now==1?"Bob":"Alice")<<endl;
	}
}