#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
//#include <regex>

/* g++ -g -std=c++0x */
/* g++ -g -std=c++11 */

using namespace std;

// std::ios::sync_with_stdio(false);

// freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);

#define ALL(c)          (c).begin(), (c).end()
#define ALLR(c)         (c).rbegin(), (c).rend()
#define FOR(i,a,b)      for (int i=(a); i < (b); ++i)
#define FORR(i,a,b)     for (int i=(a); i > (b); --i)
#define FOR_ALL(i,c)    for (__typeof((c).begin()) i=(c).begin();   \
                             i != (c).end(); ++i)
#define FOR_ALLR(i,c)   for (__typeof((c).rbegin()) i=(c).rbegin(); \
                             i != (c).rend(); ++i)
#define SZ(array)       (sizeof(array)/sizeof(array[0]))
#define lc(x)           (x<<1)     /* 2*x */
#define rc(x)           (x<<1 | 1) /* 2*x+1 */
#define lowbit(x)       (x & (-x)) /* 0b10100 -> 0b100 */

typedef long long       LL;
typedef map<int,int>    MII;
typedef pair<int,int>   PII;
typedef set<int>        SI;
typedef vector<bool>    VB;
typedef vector<double>  VD;
typedef vector<int>     VI;
typedef vector<string>  VS;

/* check if a key is in container C */
template <class C>
inline bool in_(const typename C::key_type& k, const C& A)
{ return A.find(k) != A.end(); }
inline bool in_(const string& s, const string& S)
{ return S.find(s) != string::npos; }

/*
 * Suppose that the root has k > 1 children. In this case, we can
 * decompose the original tree into k smaller trees, and the Grundy
 * Number of the original tree is XOR of the Grundy Numbers of new k
 * trees.
 *
 * If the root has exactly one child, we can compute the Grundy Number
 * using the following theorem:
 *
 * Theorem. Let G(T) be the Grundy Number of a rooted tree T. Let T' be
 * a rooted tree obtained by attaching an edge to the root of T (and the
 * new root is the new node attached to the old root). Then,
 * G(T') = G(T)+1.
 *
 * Proof. We can prove it by the induction on the number of vertices in
 * T. Let's compute the Grundy Number of T'.
 *
 * If we remove the new edge, we get a single node, and its Grundy
 * Number is zero.
 *
 * Suppose that we remove one of other edges, and we get a new tree S.
 * This tree is of the form
 * "(one of trees reachable from T) + (one edge)". By the induction
 * hypothesis, in the set of Grundy Numbers of these trees,
 * 0+1, 1+1, .. ,G(T)-1+1 will appear, but G(T)+1 won't.
 * Therefore, G(T') = G(T) + 1.
 */

const int maxv = 1e5+5;
int vis[maxv];
VI G[maxv];

int dfs(const int u)
{
    vis[u]++;
    int ans = 0;
    FOR_ALL(v,G[u]) if (!vis[*v]) 
        ans ^= 1+dfs(*v);
    return ans;
}

int main()
{
/* #ifndef ONLINE_JUDGE */
/*     freopen("foo", "rt", stdin); */
/* #endif */
    int N;
    while (cin >> N) {
        FOR(i,0,N+1)
            G[i].clear();
        FOR(_,1,N) {
            int x,y; cin >> x >> y;
            G[x].push_back(y);
            G[y].push_back(x);
        }
        memset(vis,0,sizeof(vis));
        const int grundy = dfs(1);
        const string ans = grundy ? "Alice" : "Bob";
        cout << ans << endl;
    }
    return 0;
}


Measured memory_bytes: 9216