#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 100'447;
VI g[N];
int cntL[N];
int h[N];
int mh[N];
int win;

void dfs(int v, int p = -1, int hei = 0)
{
	h[v] = hei;
	mh[v] = h[v];
	if (SZ(g[v]) == 1 && p != -1)
		cntL[v] = 1;
	for (auto to : g[v])
	{
		if (to != p)
		{
			dfs(to, v, hei + 1);
			cntL[v] += cntL[to];
			mh[v] = max(mh[v], mh[to]);
		}
	}
	if (cntL[v] > mh[v])
		win = 1;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	FOR (i, 0, n - 1)
	{
		int u, v;
		cin >> u >> v;
		u--, v--;
		g[u].PB(v);
		g[v].PB(u);
	}
	dfs(0);
	if (!win)
		win = n & 1;
	cout << (win ? "Alice\n" : "Bob\n");
	
	
	return 0;
}