#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cstdlib>
#include <queue>
#include <unordered_map>

using namespace std;

typedef long long int ll;
typedef pair<int, int> Pii;

const ll mod = 1000000007;

struct unionfind {
  vector<int> group;

  unionfind(int n) {
    group = vector<int>(n);
    for (int i = 0; i < n; i++) group[i] = i;
  }

  int root(int x) {
    if (group[x] == x) return x;
    return group[x] = root(group[x]);
  }

  void unite(int x, int y) {
    int rx = root(x);
    int ry = root(y);
    if (rx == ry) return;
    group[rx] = ry;
  }

  bool same(int x, int y) {
    int rx = root(x);
    int ry = root(y);
    return rx == ry;
  }
};

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

  int n;
  cin >> n;
  vector<vector<int> > edge(n);
  for (int i = 0; i < n-1; i++) {
    int a, b;
    cin >> a >> b;
    edge[a].push_back(b);
    edge[b].push_back(a);
  }

  unionfind uf(n);
  for (int i = 0; i < n; i++) {
    for (auto &x: edge[i]) {
      uf.unite(i, x);
    }
  }

  unordered_map<int, int> count;
  for (int i = 0; i < n; i++) {
    count[uf.root(i)]++;
  }

  int maximum = 0;
  for (auto &x: count) {
    if (x.second > maximum) {
      maximum = x.second;
    }
  }

  bool good = false;
  if (maximum == n) good = true;
  else if (maximum == n-1) {
    int deg2count = 0;
    for (int i = 0; i < n; i++) {
      if (edge[i].size() == 2) deg2count++;
    }
    if (deg2count == n-1) good = true;
  }

  if (good) cout << "Bob" << endl;
  else cout << "Alice" << endl;

  return 0;
}