#include <iostream> #include <iomanip> #include <vector> #include <utility> #include <map> #include <algorithm> #include <queue> #include <cmath> #include <numeric> #include <set> using namespace std; struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa; template <class T>ostream &operator<<(ostream &o,const vector<T>&v){o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;} #define debug(v) {cerr<<"\033[1;36m[debug]\033[m "<<#v<<" : "<<v<<endl;} using int64 = long long; using P = pair<int,int>; void dfs(int u, const vector<vector<int64>> & g, vector<bool>& visited) { if(visited[u]) return; visited[u] = true; for (const auto& v : g[u]) dfs(v,g,visited); } int main() { int64 n; cin >> n; vector<vector<int64>> g(n); for (int i = 0; i < n - 1; i++) { int64 u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } map<int,int> mp; for (int i=0; i<n; i++) { mp[g[i].size()]++; } int cnt = 0; vector<bool>visited(n,false); for (int i=0; i<n; i++) { if(!visited[i]) { cnt++; dfs(i,g,visited); } } bool ans = false; if (cnt == 1) ans = true; if (cnt == 2 && mp[0] == 1 && mp[2] == n-1) ans = true; cout << (ans? "Bob" : "Alice") << endl; }