#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define INF 1000000001LL
#define LNF 1000000000000000001LL
#define MOD 1000000007LL
#define MAX 502
#define long long long
#define all(x) x.begin(),x.end()
using namespace std;



//UnionFind
class UnionFind
{
public:
    vector<int> parent;
    vector<int> cnt;
    void init(int size)
    {
        parent.resize(size);
        cnt.resize(size);
        for(int i = 0; i<size; i++)
        {
            parent[i] = i;
            cnt[i] = 1;
        }
    }
    int find(int x)
    {
        if(parent[x] == x)
            return x;
        return parent[x] = find(parent[x]);
    }
    void merge(int x, int y)
    {
        x = find(x);
        y = find(y);
        if(x == y)
            return;
        if(x < y)
        {
            parent[y] = x;
            cnt[x]+=cnt[y];
        }
        else
        {
            parent[x] = y;
            cnt[y]+=cnt[x];
        }
    }
    bool isUnion(int x, int y)
    {
        x = find(x);
        y = find(y);
        if(x == y)
            return true;
        return false;
    }
};
int main()
{
	ios_base::sync_with_stdio(0); 
    cin.tie(0);

    int n;
    cin >> n;

    UnionFind uf;
    uf.init(n);
    vector<int> g(n);
    for(int i = 0; i<n-1; i++)
    {
        int a,b;
        cin >> a >> b;
        uf.merge(a,b);
        g[a]++;
        g[b]++;
    }
    int cnt = 0;
    int one = 0;
    for(int i = 0; i<n; i++)
    {
        if(uf.find(i) == i)
            cnt++;
        if(g[i] == 1)
            one++;
    }

    if(cnt > 2 || (cnt == 2 && one))
        cout << "Alice\n";
    else
        cout << "Bob\n";
    return 0;
}