#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
int n;
struct edge {
	int to, nxt;
}eg[maxn * 2 + 10];
int h[maxn + 10], egcnt;

inline void addeg(int &h, int to) {
	eg[++egcnt] = (edge){to, h};
	h = egcnt;
}

int dfs(int p, int fa) {
	int ans = 0;
	for (int i = h[p]; i; i = eg[i].nxt)
		if (eg[i].to != fa) ans ^= dfs(eg[i].to, p) + 1;
	return ans;
}

int main() {
	scanf("%d", &n);
	for (int i = 1; i < n; ++i) {
		int l, r; scanf("%d%d", &l, &r);
		addeg(h[l], r); addeg(h[r], l);
	}
	printf("%s", dfs(1, 0) ? "Alice" : "Bob");
}
