#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
const int N = 55;

int n, deg[N];

void solve() {
    scanf("%d", &n);
    for (int i = 1, u, v; i < n; ++i) {
        scanf("%d %d", &u, &v);
        ++deg[u];
        ++deg[v];
    }
    int leaf = 0;
    for (int i = 1; i <= n; ++i) {
        leaf += (deg[i] == 1);
    }
    int ans = n - 1 - leaf;
    puts(ans & 1? "Alice" : "Bob");
}

int main() {
    solve();
    return 0;
}