#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvv vector<vvl>
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvvl(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define rep(c, a, b) for(ll c=a;c<b;c++)
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

vvl G = vv(100001, 0, 0, ll);
vll use(100001, 0);

void dfs(ll now, ll from){
  if(use[now]) return ;
  use[now] = 1;
  for(int i=0;i<G[now].size();i++){
    if(G[now][i]==from) continue;
    dfs(G[now][i], now);
  }
}
int main(int argc, char const *argv[]) {
  ll a, b, n;std::cin >> n;
  re(i, n-1){
    std::cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  dfs(0, -1);
  for(int i=0;i<n;i++){
    if(!use[i]){
      std::cout << "Alice" << '\n';
      return 0;
    }
  }
  std::cout << "Bob" << '\n';
  return 0;
}