#include<bits/stdc++.h>
using namespace std;
#define int long long 
const int maxn = 2e5+5;

int n,sz[maxn],total;
vector<int> edge[maxn];

int res=-1;
vector<int> pos;
void dfs(int u,int p){
    sz[u]=1;
    for(int v:edge[u]) if(v!=p) dfs(v,u),sz[u]+=sz[v];
    total+=sz[u];
}

void dfs2(int u,int p){
    if(total>res) res=total,pos={u};
    else if(total==res) pos.push_back(u);
    for(int v:edge[u]) if(v!=p){
        total+=n-2*sz[v];
        dfs2(v,u);
        total-=n-2*sz[v];
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cin >> n;
    for(int i=1;i<n;i++){
        int u,v;cin >> u >> v;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    dfs(1,0);
    dfs2(1,0);
    cout << (int)pos.size() << '\n';
    sort(pos.begin(),pos.end());
    for(int u:pos) cout << u << ' ';
    cout << '\n';
}