#include<cstdio>

 #include<iostream>

 #include<cmath>

 #include<algorithm>

 #include<cstring>

 #include<cstdlib>

 #include<cctype>

 #include<vector>

 #include<stack>

 #include<queue>

 using namespace std;

 #define enter puts("")

 #define space putchar(' ')

 #define Mem(a, x) memset(a, x, sizeof(a))

 #define rg register

 typedef long long ll;

 typedef double db;

 const int INF = 0x3f3f3f3f;

 const db eps = 1e-;

 const int maxn = 5e4 + ;

 inline ll read()

 {

     ll ans = ;

     char ch = getchar(), last = ' ';

     while(!isdigit(ch)) {last = ch; ch = getchar();}

     while(isdigit(ch)) {ans = ans *  + ch - ''; ch = getchar();}

     if(last == '-') ans = -ans;

     return ans;

 }

 inline void write(ll x)

 {

     if(x < ) x = -x, putchar('-');

     if(x >= ) write(x / );

     putchar(x %  + '');

 } 

 int n;

 struct Node

 {

     int nxt, to;

 }e[maxn << ];

 int head[maxn], ecnt = ;

 void add(int x, int y)

 {

     e[++ecnt].to = y;

     e[ecnt].nxt = head[x];

     head[x] = ecnt;

 }

 bool vis[maxn];

 int siz[maxn], Max[maxn];

 void dfs(int now, int fa)

 {

     siz[now] = ; Max[now] = -;

     for(int i = head[now]; i; i = e[i].nxt)

     {

         if(e[i].to == fa) continue;

         dfs(e[i].to, now);

         siz[now] += siz[e[i].to];

         Max[now] = max(Max[now], siz[e[i].to]);

     }

     Max[now] = max(Max[now], n - siz[now]);

 }

 int main()

 {

     n = read();

     Mem(vis, ); Mem(head, ); ecnt = ;

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

     {

         int x = read(), y = read();

         add(x, y); add(y, x);

     }

     dfs(, );

     int Min = INF;

     for(int i = ; i <= n; ++i) Min = min(Min, Max[i]);

     for(int i = ; i <= n; ++i) if(Max[i] == Min) write(i), space;

     enter;

     return ;

 }