#include using namespace std; # define REP(i,n) for (int i=0;i<(n);++i) # define rep(i,a,b) for(int i=a;i<(b);++i) # define all(v) v.begin(),v.end() # define showVector(v) REP(i,v.size()){cout << (v[i]) << " ";} cout << endl; template inline bool chmin(T &a, T b){ if(a > b) { a = b; return true;} return false;} template inline bool chmax(T &a, T b){ if(a < b) { a = b; return true;} return false;} typedef long long int ll; typedef pair P_ii; typedef pair P_dd; template vector make_vec(size_t a){ return vector(a); } template auto make_vec(size_t a, Ts... ts){ return vector(ts...))>(a, make_vec(ts...)); } template typename enable_if::value==0>::type fill_v(T &t,const V &v){t=v;} template typename enable_if::value!=0>::type fill_v(T &t,const V &v){ for(auto &e:t) fill_v(e,v); } ll gcd(ll a, ll b) { if(a < b) swap(a,b); if(b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b){ ll g = gcd(a,b); return (a/g)*b; } // 素数判定 O(√n) bool is_prime(int n){ for(int i = 2; i * i <= n; i++){ if(n % i == 0) return false; } return true; } // 約数列挙 O(√n) vector divisor(ll n){ vector res; for(ll i = 1; i * i <= n; i++){ if(n % i == 0){ res.push_back(i); if(i != n / i) res.push_back(n / i); } } return res; } vector > prime_factorize(ll n) { vector > res; for (ll p = 2; p * p <= n; ++p) { if (n % p != 0) continue; ll num = 0; while (n % p == 0) { ++num; n /= p; } res.push_back(make_pair(p, num)); } if (n != 1) res.push_back(make_pair(n, 1)); return res; } // auto mod int // https://youtu.be/L8grWxBlIZ4?t=9858 // https://youtu.be/ERZuLAxZffQ?t=4807 : optimize // https://youtu.be/8uowVvQ_-Mo?t=1329 : division const int mod = 1000000007; struct mint { ll x; // typedef long long ll; mint(ll x=0):x(x%mod){} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res+=a; } mint operator-(const mint a) const { mint res(*this); return res-=a; } mint operator*(const mint a) const { mint res(*this); return res*=a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res/=a; } }; const int MOD = 1000000007; const int inf=1e9+7; const ll longinf=1LL<<60 ; void addM(ll &a, ll b) { a += b; if (a >= MOD) a -= MOD; } void mulM(ll &a, ll b) { a = ((a%MOD)*(b%MOD))%MOD ; } ll powM(ll a,ll b) { ll ret = 1; ll tmp = a; while(b>0) { if((b&1)==1) ret = (ret * tmp) % MOD; tmp = (tmp * tmp) % MOD; b = b >> 1; } return ret; } // mod. m での a の逆元 a^{-1} を計算する ll modinv(ll a, ll m) { ll b = m, u = 1, v = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= m; if (u < 0) u += m; return u; } // ラングレンス圧縮 vector> rang_com(string s){ vector> ret; string t = s; t.erase(unique(all(t)), t.end()); int now = 0; int pre = 0; for(auto ct : t){ while(now < s.size() && s[now] == ct) now++; if(ret.size() == 0){ ret.push_back({ct, now}); } else { ret.push_back({ct, now - pre}); } pre = now; } return ret; } struct UnionFind { vector par; vector sz; map szmp; // map UnionFind(int n = 0){ if(n > 0) initialize(n); } void initialize(int n){ par.resize(n); sz.resize(n); for(int i = 0; i < n; i++){ par[i] = i; sz[i] = 1; } szmp[1] = n; } int find(int x){ if(par[x] == x){ return x; } else { return par[x] = find(par[x]); } } void unite(int x, int y){ x = find(x); y = find(y); if(x == y) return; if(sz[x] > sz[y]) swap(x, y); for(int s : {sz[x], sz[y]}){ szmp[s]--; if(szmp[s] == 0) szmp.erase(s); } par[x] = y; sz[y] += sz[x]; szmp[sz[y]]++; } bool same(int x, int y){ return find(x) == find(y); } int size(int x){ return sz[find(x)]; } int minsz(){ return szmp.begin() -> first; } int unitenum(){ return szmp.size(); } }; vector g[(int)1e5]; bool isVist[(int)1e5]; int dfs(int s){ int ret = 1; isVist[s] = true; for(int v : g[s]){ if(isVist[v]) continue; ret += dfs(v); } return ret; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; REP(i, n - 1){ int a, b; cin >> a >> b; g[a].push_back(b); g[b].push_back(a); } int cnt = 0; vector vec; REP(i, n){ if(isVist[i]) continue; cnt++; vec.push_back(dfs(i)); } sort(all(vec), greater<>()); if(cnt == 1){ cout << "Bob" << endl; } else if(cnt == 2 && vec[0] == n - 1){ bool chk = true; int cnt2 = 0; REP(i, n){ if(g[i].size() != 2) chk = false; else if(g[i].size() == 0) cnt2++; } if(cnt2 == 1 && chk) { cout << "Bob" << endl; } else { cout << "Alice" << endl; } } else { cout << "Alice" << endl; } return 0; }