#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<(b);++i)
using namespace std;
using pii = pair<int,int>;
using ll = long long;
using ull = unsigned long long;
using lll = __int128;
using pll = pair<ll,ll>;
using vi = vector<int>;

#define fr first 
#define sc second

using ld = long double;

#define all(x) (x).begin(), (x).end()

const int maxn = 1e6+10, inf = 1e9+100;
const ll linf = 8e18+100;
const int mod = 998244353;



// #define cerr if(0) cerr

vi g[maxn];
void solve () {
	int n;
	cin >> n;
	for(int i=0;i<n-1;i++){
		int a,b;
		cin >> a >> b;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	int rel = 0;
	for(int i=0;i<n;i++)if(g[i].size()>1)rel++;
	if(n<=2||rel%2==1){
		cout << "Bob\n";
	}
	else {
		cout << "Alice\n";
	}
}


int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout<<fixed;
  cout.precision(20);
	// int tc;
	// cin >> tc;
	// while(tc--)
  solve();
}