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

struct UnionFind {
  vector< int > data;
 
  UnionFind(int sz) {
    data.assign(sz, -1);
  }
 
  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if(x == y) return (false);
    if(data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return (true);
  }
 
  int find(int k) {
    if(data[k] < 0) return (k);
    return (data[k] = find(data[k]));
  }
 
  int size(int k) {
    return (-data[find(k)]);
  }
};

int main()
{
	int N;
	cin >> N;
	vector<vector<int>> g( N );
	for( int i = 0; i < N - 1; i++ ) {
		int u, v;
		cin >> u >> v;
		g[u].push_back( v );
		g[v].push_back( u );
	}

	UnionFind uf( N );
	for( int i = 0; i < N; i++ ) {
		for( int j : g[i] ) {
			uf.unite( i, j );
		}
	}
	string ans = "Alice";
	if( uf.size( 0 ) == N ) ans = "Bob";
	else if( uf.size( 0 ) == N - 1 ) {
		int cnt = 0;
		for( int i = 0; i < N; i++ ) {
			if( g[i].size() == 0 ) continue;
			if( g[i].size() == 1 ) {
				cnt++;
			}
		}
		if( cnt == 0 ) ans = "Bob";
	}

	cout << ans << endl;
}