#include #include using namespace std; typedef vector> graph; void f(graph& g, bool c[], int node) { c[node] = true; for (int i : g[node]) { if (c[i] == false) { f(g, c, i); } } } int main() { int n; cin >> n; graph g(n); for (int i = 0; i < n-1; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } bool c[n] = {}; f(g, c, 0); bool flag = true; for (int i = 0; i < n; i++) { if (c[i] == false) flag = false; } cout << (!flag ? "Alice" : "Bob") << endl; }