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

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

int n;
const int INF = 1001001001;
vector<int> G[100005];
int dist[100005];
bool seen[100005];
bool loopflag = false;

struct UnionFind {
  vector<int> par, siz;

  // 初期化
  UnionFind(int n) : par(n, -1), siz(n, -1) { }

  int root(int x) {
    if (par[x] == -1) return x;
    else return par[x] = root(par[x]);

  }

  bool issame(int x, int y) {
    return root(x) == root(y);
  }

  bool merge(int x, int y) {
    x = root(x), y = root(y);

    if (x == y) return false;

    if (siz[x] < siz[y]) swap(x, y);

    par[y] = x;
    siz[x] += siz[y];
    return true;
  }

  int size(int x) {
    return -siz[root(x)];
  }
};

int main() {
  cin >> n;
  UnionFind uf(n);
  rep(i,n-1) {
    int u, v;
    cin >> u >> v;
    G[u].push_back(v);
    G[v].push_back(u);
    uf.merge(u,v);
  }
  int cnt = 0;
  rep(i,n) {
    if (uf.root(i) == i) cnt++;
  }
  string ans = "Alice";
  if (cnt == 1) ans = "Bob";
  else if (cnt == 2) {
    bool flag = true;
    rep(i,n) {
      if (G[i].size() != 0 && G[i].size() != 2) flag = false;
    }
    if (flag) ans = "Bob";
  }
  cout << ans << endl;



}