/*
ID: computerbox --> Huseyn Hajiyev
LANG: C++
TASK: target_mode_on
*/
#include <bits/stdc++.h>
#define FAST_READ ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define endl "\n"
#define MAXN 50010

using namespace std;


//Centroid Decomposition God Father problem----> https://www.e-olymp.com/en/problems/5366

ll n;
vector<ll>adj[MAXN];
ll dp[MAXN];
ll used[MAXN];


void dfs(ll v,ll prev)
{
  dp[v]=1;
  for(auto to: adj[v])
  {
    if(to!=prev)
    {
      dfs(to,v);
      dp[v]+=dp[to];
    }
  }
}

int main(){
FAST_READ;
cin>>n;
ll x,y;
for(ll i=1;i<n;i++)
{
  cin>>x>>y;
  adj[x].pb(y);
  adj[y].pb(x);
}
dfs(1,0);
vector<ll>ans;
ll maxa=0;
ll ind=0;
for(ll i=1;i<=n;i++)
{
  if(dp[i]*2==n)
  {
    ind=i;
    break;
  }
}
ll indd=0;
maxa=LLONG_MAX;
for(ll i=1;i<=n;i++)
{
  if(dp[i]>=n/2+1)
  {
    if(dp[i]<maxa)
    {
      maxa=dp[i];
      indd=i;

    }
  }
}

if(ind!=0)cout<<min(ind,indd)<<" "<<max(indd,ind)<<endl;
else cout<<indd<<endl;
return 0;
}