#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  vector<vector<int> > edges(n);
  REP (i, n-1) {
    int v, w;
    cin >> v >> w;
    edges[v].push_back(w);
    edges[w].push_back(v);
  }

  vector<bool> vis(n);
  queue<int> q;
  q.push(0);
  vis[0] = true;

  while (!q.empty()) {
    int x = q.front();
    q.pop();
    for (int y: edges[x]) {
      if (!vis[y]) {
        q.push(y);
        vis[y] = true;
      }
    }
  }

  
  if (count(ALL(vis), false) < 2)
    cout << "Bob" << endl;
  else
    cout << "Alice" << endl;
  
  return 0;
}