#include<bits/stdc++.h> using namespace std; using Int = long long; template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;} template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;} struct UnionFind{ Int num; vector<Int> rs,ps; UnionFind(){} UnionFind(Int n):num(n),rs(n,1),ps(n,0){iota(ps.begin(),ps.end(),0);} Int find(Int x){ return (x==ps[x]?x:ps[x]=find(ps[x])); } bool same(Int x,Int y){ return find(x)==find(y); } void unite(Int x,Int y){ x=find(x);y=find(y); if(x==y) return; if(rs[x]<rs[y]) swap(x,y); rs[x]+=rs[y]; ps[y]=x; num--; } Int size(Int x){ return rs[find(x)]; } Int count() const{ return num; } }; template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);} //INSERT ABOVE HERE signed main(){ Int n; cin>>n; UnionFind uf(n); vector<Int> deg(n); for(Int i=1;i<n;i++){ Int a,b; cin>>a>>b; uf.unite(a,b); deg[a]++; deg[b]++; } if(uf.count()==1) drop("Bob"); if(uf.count()==3) drop("Alice"); if(uf.count()==2&&*max_element(deg.begin(),deg.end())==2) for(Int i=0;i<n;i++) if(uf.size(i)==1) drop("Bob"); drop("Alice"); return 0; }