#include<stdio.h>

#include<algorithm>

#include<string.h>

#include<vector>

using namespace std;

const int MAXN = ;

int val[MAXN], MinVal, cnt, N;

bool used[MAXN];

vector<int> G[MAXN];

int DFS(int k)

{

    int sumSon = ;

    for(int i=; i<G[k].size(); i++)

    {

        int v = G[k][i];

        if(!used[v])

        {

            used[v] = true;

            int son = DFS(v);

            val[k] = max(val[k], son);

            sumSon += son;

        }

    }

    val[k] = max(val[k], N-sumSon-);

    if(MinVal > val[k])

    {

        MinVal = val[k];

        cnt = ;

    }

    else if(MinVal == val[k])

        cnt++;

    return sumSon + ;

}

int main()

{

    int u, v;

    scanf("%d", &N);

    for(int i=; i<N; i++)

    {

        scanf("%d%d", &u, &v);

        G[u].push_back(v);

        G[v].push_back(u);

    }

    MinVal = MAXN;

    used[] = true;

    DFS();

    printf("%d %d\n", MinVal, cnt);

    int flag=;

    for(int i=; i<=N; i++)

    {

        if(val[i] == MinVal)

        {

            if(flag++)printf(" ");

            printf("%d", i);

        }

    }

    printf("\n");

    return ;

}