// yuki 977 アリス仕掛けの摩天楼
// 2020.2.24 bal4u

#include <stdio.h>

int getchar_unlocked(void);
#define gc() getchar_unlocked()

int in() {  // 整数の入力
	int n = 0; int c = gc();
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

#define MAX 100005

/* UNION-FIND library */
int id[MAX], size[MAX];
void init(int n) { int i; for (i = 0; i < n; i++) id[i] = i, size[i] = 1; }
int root(int i) { while (i != id[i]) id[i] = id[id[i]], i = id[i]; return i; }
int connected(int p, int q) { return root(p) == root(q); }
void unite(int p, int q) {
    int i = root(p), j = root(q); if (i == j) return;
    if (size[i] < size[j]) id[i] = j, size[j] += size[i]; else id[j] = i, size[i] += size[j];
}

int hi[MAX];
int main()
{
	int i, a, b, n, N;
	static char *ans[] = { "Alice", "Bob" };

	N = in();
	init(N);
	for (i = 1; i < N; ++i) {
		a = in(), b = in();
		hi[a]++, hi[b]++;
		unite(a, b);
	}
	a = 0;
	n = size[root(0)];
	if (n == 1) n = size[root(1)];
	if (n == N) a = 1;
	else if (n == N-1) {
		for (i = 0; i < N; ++i) {
			if (hi[i] == 1) break;
		}
		if (i == N) a = 1;
	}
	puts(ans[a]);
	return 0;
}