#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

class UnionFind{
  int n;
  vector<int> data;
public:
  UnionFind(int _n):n(_n),data(_n,-1){}
  bool link(int a, int b){ //if new link, then true.
    int ra=find_root(a);
    int rb=find_root(b);
    if(ra!=rb){
      if(data[rb]<data[ra]) swap(ra,rb);
      data[ra]+=data[rb];
      data[rb]=ra;
    }
    return (ra!=rb);
  }
  bool check(int a, int b){ //if same set, then true.
    return (find_root(a)==find_root(b));
  }
  int find_root(int a){
    return ((data[a]<0)?a:(data[a]=find_root(data[a])));
  }
};

vector<int> G[100005];

int main(){
  int N;
  cin >> N;

  UnionFind uf(N);
  rep(i,N-1){
    int a, b;
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
    uf.link(a,b);
  }

  map<int,vector<int>> m;
  rep(i,N){
    m[uf.find_root(i)].push_back(i);
  }

  if(m.size() == 1){
    cout << "Bob" << endl;
  }
  else if(m.size() == 2){
    bool ok = false;
    FOR(it,m){
      if((it->second).size() >= 2){
        rep(j,(it->second).size()){
          if(G[(it->second)[j]].size() == 1) ok = true;
        }
      }
    }
    if(ok) cout << "Alice" << endl;
    else cout << "Bob" << endl;
  }
  else{
    cout << "Alice" << endl;
  }
  
  
  return 0;
}