#define _USE_MATH_DEFINES #include using namespace std; const int INF = 1 << 30; bool dfs (int cur, const vector>& g, vector& order, vector& reach) { bool res = false; reach[cur] = order[cur]; for (int nbr : g[cur]) { if (order[nbr] == INF) { order[nbr] = order[cur] + 1; res |= dfs (nbr, g, order, reach); } reach[cur] = min(reach[cur], order[nbr]); } return res | (reach[cur] >= order[cur]); } signed main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector> g(n); for (int i = 0; i + 1 < n; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } vector order(n, INF); vector reach(n, INF); int c = 0; bool b = false; for (int i = 0; i < n; i++) { if (order[i] == INF) { c++; order[i] = 0; b = dfs (i, g, order, reach); } } if (c > 1 && b) cout << "Alice\n"; else cout << "Bob\n"; return 0; }