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

int main() {
	int n; cin >> n;
	vector<int> v(2 * (n - 1));
	for(int i = 0; i < n - 1; ++i) {
		cin >> v[2 * i] >> v[2 * i + 1];
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	if(v.size() == n) {
		cout << "Bob" << '\n';
	} else {
		cout << "Alice" << '\n';
	}
	return 0;
}