#include <iostream>
#include <utility>
#include <tuple>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <functional>
#include <climits>
#include <numeric>
#include <queue>
#include <cmath>
#include <iomanip>
#include <array>
#include <string>
#include <stack>
#include <cassert>
#include <memory>
#include <random>
#include <fstream>
#include <cfloat>
#include <complex>

void dfs(const int current, int prev, int &order, std::vector<int>& ord, std::vector<int>& low, const std::vector<std::vector<int>> &nodes) {
	low[current] = ord[current] = order++;
	for (const auto next : nodes[current]) {
		if (next == prev) continue;
		if (ord[next] >= 0) {
			low[current] = std::min(low[current], ord[next]);
		}
		else {
			dfs(next, current, order, ord, low, nodes);
			low[current] = std::min(low[current], low[next]);
		}
	}
}
int main() {
	int n; std::cin >> n;
	std::vector<std::vector<int>> islands(n);
	for (auto i = 1; i < n; ++i) {
		int u, v; std::cin >> u >> v;
		islands[u].push_back(v);
		islands[v].push_back(u);
	}
	int order{ 0 };
	std::vector<int> ord(n, -1), low(n, -1);
	int count{ 0 };
	for (auto i = 0; i < n; ++i) {
		if (ord[i] == -1) {
			dfs(i, -1, order, ord, low, islands);
			++count;
		}
	}
	if (count == 1) {
		std::cout << "Bob\n";
	}
	else if (count == 2) {
		for (auto i = 0; i < n; ++i) {
			for (const auto next : islands[i]) {
				if (ord[i] < low[next]) {
					++count;
				}
			}
		}
		std::cout << (count == 2 ? "Bob\n" : "Alice\n");
	}
	else {
		std::cout << "Alice\n";
	}
}