//#include #include #include #define REP(i, x, y) for (ll i = x; i <= y; i++) #define BIT(t) (1ll << t) #define PER(i, y, x) for (ll i = y; i >= x; i--) #define vll vector #define vvll vector> #define pll pair #define SIZE(v) ll(v.size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()); using namespace std; typedef long long ll; // ios::sync_with_stdio(false); // cin.tie(nullptr); void dfs(ll n,ll cur, vll& color, vvll& g){ if(color[cur] == 1){ return; }else{ color[cur] = 1; for(auto x: g[cur]){ if(color[x] == 0){ dfs(n, x, color, g); } } } } int main(){ ll n; cin >> n; vvll g(n); REP(i,1,n-1){ ll u,v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } vll color(n,0); ll conn = 0; REP(i,0,n-1){ if(color[i] == 0){ dfs(n,i,color, g); conn++; } } if(conn == 1){ cout << "Bob" << endl; return 0; }else if(conn == 2){ REP(i,0,n-1){ if(g[i].size()==1 || g[i].size() > 2){ cout << "Alice" << endl; return 0; } } cout << "Bob" << endl; }else{ cout << "Alice" << endl; } }