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

struct UnionFind {
  vector<int> t;
  int c;
  UnionFind(int n) : t(n, -1), c(n) {}
  int find(int v) { return t[v] < 0 ? v : t[v] = find(t[v]); }
  void unite(int u, int v) {
    if ((u = find(u)) == (v = find(v))) return;
    if (-t[u] < -t[v]) swap(u, v);
    t[u] += t[v];
    t[v] = u;
    --c;
  }
  bool same(int u, int v) { return find(u) == find(v); }
  int size(int v) { return -t[find(v)]; }
};

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  UnionFind uf(n);
  vector<int> d(n);
  for (int _ = n - 1; _--; ) {
    int u, v;
    cin >> u >> v;
    uf.unite(u, v);
    ++d[u], ++d[v];
  }
  if (uf.c == 1) {
    cout << "Bob\n";
  } else if (uf.c >= 3) {
    cout << "Alice\n";
  } else {
    bool b = true;
    for (int v = 0; v < n; ++v) {
      if (not (uf.size(v) == 1 or d[v] == 2)) {
        b = false;
        break;
      }
    }
    if (b) {
      cout << "Bob\n";
    } else {
      cout << "Alice\n";
    }
  }
}