#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<int> G[100005];
int solve(int v,int p){
  int x = 0;
  for(int to : G[v]) {
    if (to != p)
      x ^= solve(to,v)+1;
  }
  return x;
}
int main(){
  int n; cin >> n;
  for(int i=0;i<n-1;i++){
    int a,b; cin >> a >> b;
    G[a].emplace_back( b );
    G[b].emplace_back( a );
  }
  if( solve( 1, 1 ) ) cout << "Alice" << endl;
  else cout << "Bob" << endl;
}