#include<iostream>

#include<cstdio>

#include<cstdlib>

#include<set>

#include<vector>

#include<cstring>

#include<iterator>

#include<algorithm>

using namespace std;

#define N       (10010)

int n;

vector<int> vcMap[N];

bool bVis[N] = {};

int maxLen = ;

set<int> setRes;

set<int> setRes2;

set<int> setRes3;

void dfs(int curI,int iLen)

{

    bVis[curI] = ;

    ++iLen;

    if(iLen > maxLen)

    {

        setRes.clear();

        maxLen = iLen;

        setRes.insert(curI);

    }

    else if(iLen == maxLen)

    {

        setRes.insert(curI);

    }

    for(int i=;i<vcMap[curI].size();++i)

    {

        if(!bVis[vcMap[curI][i]])

            dfs(vcMap[curI][i],iLen);

    }

}

int main()

{

    scanf("%d",&n);

    for(int i=;i<n-;++i)

    {

        int a,b;

        scanf("%d%d",&a,&b);

        vcMap[a].push_back(b);

        vcMap[b].push_back(a);

    }

    int k=;

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

    {

        if(!bVis[i])

        {

            ++k;

            dfs(i,);

            set_union(setRes.begin(), setRes.end(), setRes2.begin(),

                      setRes2.end(), inserter(setRes2, setRes2.begin()));

        }

    }

    if(k==)

    {

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

        {

            if(setRes2.find(i)!=setRes2.end())

            {

                memset(bVis,,sizeof(bVis));

                dfs(i,);

                break;

            }

        }

        set_union(setRes.begin(), setRes.end(), setRes2.begin(),

                      setRes2.end(), inserter(setRes2, setRes2.begin()));

        set<int>::iterator it = setRes2.begin();

        for(;it != setRes2.end();it++)

            printf("%d\n",*it);

    }

    else

        printf("Error: %d components\n",k);

    return ;

}