#include <bits/stdc++.h>

using namespace std;
const int MAXN = 100005;

vector<int> G[MAXN];
vector<bool> visited(MAXN, false);

void dfs(int c) {
  visited[c] = true;
  for (int i = 0; i < G[c].size(); ++i) {
    int next = G[c][i];
    if (!visited[next]) dfs(next);
  }
}

int main() {
  int N;
  scanf("%d", &N);

  for (int i = 0; i < N - 1; ++i) {
    int u, v;
    scanf("%d %d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }

  int cnt = 0;
  for (int i = 0; i < N; ++i) {
    if (!visited[i]) {
      dfs(i);
      cnt++;
    }
  }

  if (cnt == 1) {
    puts("Bob");
  } else if (cnt > 2) {
    puts("Alice");
  } else {
    for (int i = 0; i < N; ++i) {
      if (G[i].size() == 1) {
	puts("Alice");
	return 0;
      }
    }
    puts("Bob");
  }
  return 0;
}