#include <iostream>

#include <string>

#include <cstring>

#include <cstdlib>

#include <cstdio>

#include <cmath>

#include <algorithm>

#include <stack>

#include <queue>

#include <cctype>

#include <vector>

#include <iterator>

#include <set>

#include <map>

#include <sstream>

using namespace std;

#define mem(a,b) memset(a,b,sizeof(a))

#define pf printf

#define sf scanf

#define spf sprintf

#define pb push_back

#define debug printf("!\n")

#define MAXN 110000+5

#define MAX(a,b) a>b?a:b

#define blank pf("\n")

#define LL long long

#define ALL(x) x.begin(),x.end()

#define INS(x) inserter(x,x.begin())

#define pqueue priority_queue

#define INF 0x3f3f3f3f

int n,m;

struct node{int y,val,next;}tree[MAXN<<];

int head[MAXN],vis[MAXN],ptr=,dp[MAXN],num[MAXN],ans,tot,a[MAXN];

void init()

{

    mem(head,-);

    mem(vis,);

    mem(dp,);

    ans =INF;

    tot = ;

    ptr=;

}

void add(int x,int y)

{

    tree[ptr].y = y;

    tree[ptr].next = head[x];

    head[x] = ptr++;

}

void dfs(int rt)

{

    num[rt]=vis[rt]=;

    int tmp = ;

    //pf("rt%d\n",rt);

    for(int i = head[rt];i!=-;i=tree[i].next)

    {

        int y = tree[i].y;

        if(vis[y]) continue;

        dfs(y);

        num[rt]+=num[y];

        tmp = max(tmp,num[y]);

        //pf("y%d %d\n",y,tmp);

    }

    tmp = max(tmp,n-num[rt]);

    //pf("t%d %d %d\n",rt,tmp,ans);

    if(tmp<ans)

    {

        ans = tmp;

        tot = ;

        a[tot++] = rt;

    }

    else if(tmp == ans) a[tot++] = rt;

}

int main()

{

    int i,j,k,t;

    while(~sf("%d",&n))

    {

        init();

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

        {

            int x,y;

            sf("%d%d",&x,&y);

            add(x,y);

            add(y,x);

        }

        dfs();

        sort(a,a+tot);

        pf("%d",a[]);

        for(i=;i<tot;i++) pf(" %d",a[i]);

        blank;

    }

}