#include <bits/stdc++.h>
#include <math.h>

#include <algorithm>
#include <array>
#include <atcoder/all>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;
using namespace atcoder;

using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  int N;
  cin >> N;
  dsu tree(N);
  Graph G(N);
  for (int i = 0; i < N - 1; i++) {
    int u, v;
    cin >> u >> v;
    tree.merge(u, v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  auto group = tree.groups();

  if (group.size() == 1) {
    cout << "Bob" << endl;
    return 0;
  }
  if (group.size() > 2) {
    cout << "Alice" << endl;
    return 0;
  }
  if (group[0].size() == N - 1) {
    for (auto v : group[0]) {
      if (G[v].size() != 2) {
        cout << "Alice" << endl;
        return 0;
      }
    }
    cout << "Bob" << endl;
    return 0;
  }
  if (group[1].size() == N - 1) {
    for (auto v : group[1]) {
      if (G[v].size() != 2) {
        cout << "Alice" << endl;
        return 0;
      }
    }
    cout << "Bob" << endl;
    return 0;
  }

  cout << "Alice" << endl;

  return 0;
}