#include<bits/stdc++.h>
#define endl '\n';
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
constexpr ll mod2 = 998244353;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
// ios::sync_with_stdio(false);
// cin.tie(nullptr);
// ---------------------------------------------------------------------------
int N;
vector<vector<int>> G(100005);
vector<int> dist(100005,-1);
void dfs(int v){
  for(int nv:G[v]){
    if(dist[nv] != -1) continue;
    dist[nv] = 0;
    dfs(nv);
  }
  return;
}

int main(){
  cin >> N;
  rep(i,N-1){
    int a,b;
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  int cnt = 0;
  for(int i=0; i<N; i++){
    if(dist[i] == -1){
      cnt++;
      dfs(i);
    }
  }
  if(cnt == 1){
    cout << "Bob" << endl;
  }else if(cnt == 2){
    rep(i,N){
      if(G[i].size() == 1){
        cout << "Alice" << endl;
        return 0;
      }
    }
    cout << "Bob" << endl;
  }else{
    cout << "Alice" << endl;
  }
  return 0;
}