#include //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair pii; typedef pair ppii; typedef pair pipi; typedef pair pll; typedef pair ppll; typedef pair plpl; typedef tuple tl; ll mod=1000000007; ll mod2=998244353; ll mod3=1000003; ll mod4=998244853; ll inf=1LL<<60; long double pi=3.14159265358979323846L; double eps=1e-12; #define rep(i,m,n) for(int i=m;i=m;i--) #define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++) int dh[4]={1,-1,0,0}; int dw[4]={0,0,1,-1}; int ddh[8]={-1,-1,-1,0,0,1,1,1}; int ddw[8]={-1,0,1,-1,1,-1,0,1}; ll gcd(ll a,ll b){ if(a0){ if(k&1)ret*=now; now*=now; k/=2; } return ret; } ll par[800010]; ll len[800010]; ll you[800010]; void init(ll n){ for(int i=0;i>n; vector v[n]; init(n); int r=0; rep(i,0,n-1){ int a,b;cin>>a>>b; v[a].push_back(b); v[b].push_back(a); if(root(a)==root(b)){ r++; continue; } unit(a,b); } if(r>=2){ cout<<"Alice"< f,g; rep(i,0,n){ if(root(i)==root(0))f.push_back(i); else g.push_back(i); } int m=0; rep(i,0,f.size()){ //cout<