#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 1e5 + 11;
int p[N];
int find(int x) {
	if(p[x] == x) return x;
	return p[x] = find(p[x]);
}

int deg[N];

int main() {
	ios :: sync_with_stdio(false);
	int n; cin >> n;
	
	int cnt = n;
	iota(p, p + n, 0);
	for(int i = 0; i < n - 1; i ++) {
		int u, v; cin >> u >> v;
		deg[u] ++; deg[v] ++;
		int x = find(u), y = find(v);
		if(x != y) {
			cnt --;
			p[x] = y;
		}
	}
	
	if(cnt == 1) cout << "Bob\n";
	else if(cnt == 2) {
		int c = count(deg, deg + n, 2);
		if(c == n - 1)
			cout << "Bob\n";
		else
			cout << "Alice\n";
	} else
		cout << "Alice\n";
}