/*** author: yuji9511 ***/ #include using namespace std; using ll = long long; using lpair = pair; const ll MOD = 1e9+7; const ll INF = 1e18; #define rep(i,m,n) for(ll i=(m);i<(n);i++) #define rrep(i,m,n) for(ll i=(m);i>=(n);i--) #define printa(x,n) for(ll i=0;i void print(H&& h, T&&... t){cout<(t)...);} struct UnionFind { private: ll N; vector parent; vector num; vector diff_weight; public: UnionFind(ll n){ N = n; rep(i,0,N) parent.push_back(i); rep(i,0,N) num.push_back(1); rep(i,0,N) diff_weight.push_back(0); } ll root(ll x){ if(x == parent[x]){ return x; }else{ ll r = root(parent[x]); diff_weight[x] += diff_weight[parent[x]]; return parent[x] = r; } } void unite(ll a, ll b, ll w = 0){ w += weight(a); w -= weight(b); a = root(a); b = root(b); if(a == b) return; parent[b] = a; ll sum = num[a] + num[b]; num[a] = sum; num[b] = sum; diff_weight[b] = w; } bool same(ll a, ll b){ return root(a) == root(b);} ll sz(ll x){ return num[root(x)];} ll weight(ll x){ root(x); return diff_weight[x]; } ll diff(ll a, ll b){ return weight(b) - weight(a); } }; int main(){ cin.tie(0); ios::sync_with_stdio(false); ll N; cin >> N; ll u[100010], v[100010]; UnionFind uf(100010); rep(i,0,N-1){ cin >> u[i] >> v[i]; uf.unite(u[i], v[i]); } ll max_val = 0; rep(i,0,N){ max_val = max(max_val, uf.sz(i)); } if(max_val >= N-1){ print("Bob"); }else{ print("Alice"); } }