#include <bits/stdc++.h>
using namespace std;
vector <int> g[100100];
int d[100100];
void dfs(int v, int p)
{
    d[v] = 0; int z = 0, o = 0;
    for(int i = 0; i < g[v].size(); ++i)
    {
        if(g[v][i] != p)
        {
            dfs(g[v][i], v);
            if(d[g[v][i]] == 0)
                z++;
            else
                o++;
        }
    }
    if(z % 2 == 0)
    {
        if(o % 2 == 0)
            d[v] = 0;
        else
            d[v] = 1;
    }
    else
    {
        if(o % 2 == 1)
            d[v] = 1;
        else
            d[v] = 1;
    }
}

int main()
{
    int n, i, x, y, ans = 0;

    cin >> n;

    for(i = 1; i < n; ++i)
    {
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    dfs(1, 0);
    if(d[1] == 0)
        cout << "Bob";
    else
        cout << "Alice";

return 0;
}
