#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;

void dfs(int v, int p) {
  if (seen[v]) {
    if (v == 0) {
      if (dist[p] == n-1) loopflag = true;
    }
    return;
  }
  seen[v] = true;
  for (int nv : G[v]) {
    if (nv == p) continue;
    dfs(nv, v);
  }
}

int main() {
  cin >> n;
  rep(i,n-1) {
    int u, v;
    cin >> u >> v;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  rep(i,n) dist[i] = INF;
  dist[0] = 0;
  dfs(0,0);

  string ans = "Alice";
  if (loopflag) ans = "Bob";
  else {
    bool flag = true;
    rep(i,n) {
      if (!seen[i]) flag = false;
    }
    if (flag) ans = "Bob";
  }
  cout << ans << endl;



}