#include <cstdio>
#include <bitset>
#include <stack>
#include <vector>

constexpr int N = 1e5;
std::bitset<N> P;
std::vector<std::vector<int>> E;

int main(void){
    int n; scanf("%d", &n);
    E.assign(n, std::vector<int>(0));
    for(int i = 1; i < n; ++i){
        int u, v; scanf("%d%d", &u, &v);
        E[u].push_back(v); E[v].push_back(u);
    }
    std::stack<int> Stk; P[0] = true; Stk.push(0);
    while(not Stk.empty()){
        int v = Stk.top(); Stk.pop();
        for(int nv : E[v]) if(not P[nv]){
            P[nv] = true; Stk.push(nv);
        }
    }
    int cnt;{cnt = 0; for(int i = 0; i < n; ++i) if(P[i]) cnt++;}
    if(cnt >= n - 1) puts("Bob");
    else puts("Alice");
    return 0;
}