#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &a){
    if (a.empty()) return os;
    os << a.front();
    for (auto e : a | views::drop(1)){
        os << ' ' << e;
    }
    return os;
}

void dump(auto ...vs){
    ((cout << vs << ' '), ...) << endl;
}



void solve() {
    ll N;
    cin>>N;
    assert(N<300);
    vector<vector<ll>> edge(N);
    rep(i,N-1){
        ll a,b;
        cin>>a>>b;
        a--;
        b--;
        edge[a].push_back(b);
        edge[b].push_back(a);
    }
    vector<ll> G(N);
    vector<ll> W;
    {
        auto dfs=[&](auto self,ll cp,ll bp)->void {
            ll r=0;
            vector<ll> R;
            for (ll np:edge[cp]){
                if (np==bp)continue;
                self(self,np,cp);
                r^=G[np];
                R.push_back(G[np]);
            }
            rep(d,30){
                if (~r>>d&1){
                    bool flag=false;
                    for (ll ri:R){
                        if (ri>>d&1){
                            flag=true;
                        }
                    }
                    if (!flag){
                        r>>=d;
                        r^=1;
                        r<<=d;
                        break;
                    }
                }
            }
            G[cp]=r;
            return;
        };
        dfs(dfs,0,-1);
    }
    // dump(G);
    {
        ll now=0;
        auto dfs=[&](auto self,ll cp,ll bp)->void {
            for (ll np:edge[cp]){
                if (np==bp)continue;
                now^=G[np];
            }
            if (now==0){
                W.push_back(cp);
            }
            for (ll np:edge[cp]){
                if (np==bp)continue;
                now^=G[np];
                self(self,np,cp);
                now^=G[np];
            }
            for (ll np:edge[cp]){
                if (np==bp)continue;
                now^=G[np];
            }
            return;
        };
        dfs(dfs,0,-1);
    }
    cout<<"Alice"<<'\n';
    cout<<W.size()<<'\n';
    // 昇順やないか～～～～～～～～～～～～い
    sort(all(W));
    rep(i,W.size()){
        if (i!=0)cout<<' ';
        cout<<W[i]+1;
    }
    cout<<'\n';
    return;
}


int main() {
    cin.tie(0)->sync_with_stdio(0);
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}