#include<stdio.h>
int p[100005];
int root(int n)
{
	if (p[n] != n)
		p[n] = root(p[n]);
	return p[n];
}
void uni(int x, int y)
{
	x = root(x);
	y = root(y);
	if (x != y)
		p[x] = y;
	return;
}
int main()
{
	int n;
	scanf("%d", &n);
	int u, v;
	int i;
	for (i = 0; i < n; i++)
		p[i] = i;
	int q[100005];
	for (i = 0; i < n; i++)
		q[i] = 0;
	for (i = 0; i < n - 1; i++)
	{
		scanf("%d %d", &u, &v);
		uni(u, v);
		q[u]++;
		q[v]++;
	}
	int c = 0;
	for (i = 0; i < n; i++)
		if (root(i) == i)
			c++;
	if (c == 1)
		printf("Bob\n");
	else if (c > 2)
		printf("Alice\n");
	else
	{
		c = 0;
		for (i = 0; i < n; i++)
			if (q[i] != 2)
				c++;
		if (c != 1)
			printf("Alice\n");
		else
			printf("Bob\n");
	}
	return 0;
}