//#include <bits/stdc++.h>

 #include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cmath>

 #include <map>

 #include <deque>

 #include <algorithm>

 #include <vector>

 #include <iostream>

 #define pii pair<int,int>

 #define max(x,y) ((x)>(y)?(x):(y))

 #define min(x,y) ((x)<(y)?(x):(y))

 #define INF 0x7f7f7f7f

 #define LL  long long

 using namespace std;

 const double PI  = acos(-1.0);

 const int N=;

 int n, cnt, edge_cnt, head[N];

 struct node

 {

     int from, to, next;

     node(){};

     node(int from,int to,int next):from(from),to(to),next(next){};

 }edge[N*];

 void add_node(int from,int to)

 {

     edge[edge_cnt]=node(from,to,head[from]);

     head[from]=edge_cnt++;

 }

 deque<int> que;

 int DFS(int t,int far)

 {

     node e;

     int big=, sum=;

     for(int i=head[t]; i!=-; i=e.next)

     {

         e=edge[i];

         if(e.to==far)   continue;

         int tmp=DFS(e.to, t);

         big=max(big, tmp);

         sum+=tmp;

     }

     big=max(big, n-sum-);

     if(big<=cnt)

     {

         if(big<cnt) que.clear();

         cnt=big;

         que.push_back(t);

     }

     return sum+;

 }

 int main()

 {

     //freopen("input.txt", "r", stdin);

     int a, b;

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

     {

         edge_cnt=;

         cnt=INF;

         memset(head,-,sizeof(head));

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

         {

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

             add_node(a,b);

             add_node(b,a);

         }

         DFS(,-);

         sort(que.begin(),que.end());

         while(!que.empty())

         {

             printf("%d ",que.front());

             que.pop_front();

         }

         puts("");

     }

     return ;

 }