#include <bits/stdc++.h>
using namespace std;
long long modx(long long Base, long long exponent) {
  long long ans = 1;
  if (Base == 1) return Base;
  while (exponent) {
    if (exponent & 1) ans = (ans * Base) % 1000000007LL;
    Base = (Base * Base) % 1000000007LL;
    exponent = exponent >> 1;
  }
  return ans;
}
long long inmodx(long long num) { return (modx(num, 1000000007LL - 2LL)); }
bool cmp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
  if (a.first.first / 900 < b.first.first / 900) return 1;
  if (a.first.first / 900 > b.first.first / 900) return 0;
  if (a.first.second <= b.first.second) return 1;
  return 0;
}
const int N = (2e5) + 9;
const int M = (N << 2) + 9;
const int LOGN = ((int)log2(N)) + 3;
const int LOGM = ((int)log2(M)) + 3;
const int BUCK = 450;
vector<int> v[N];
vector<pair<int, int> > temp;
pair<int, pair<int, int> > leaves[N];
bool mark[N], pseudo_leaf[N];
pair<int, int> ht[N], damn;
pair<int, pair<int, int> > ans;
int root;
void dfs(int cur) {
  mark[cur] = 1;
  for (auto x : v[cur]) {
    if (!mark[x] && (int)((v[x]).size()) < 3)
      dfs(x);
    else if (!mark[x])
      pseudo_leaf[x] = 1;
  }
  return;
}
void dfs(int cur, int par) {
  for (auto x : v[cur])
    if (x != par && !mark[x]) dfs(x, cur);
  temp.clear();
  for (auto x : v[cur])
    if (x != par && !mark[x]) temp.push_back(ht[x]);
  if (temp.empty())
    ht[cur] = {0, cur};
  else {
    int i;
    sort((temp).begin(), (temp).end(), greater<pair<int, int> >());
    ht[cur] = temp[0];
    for (i = (1); i < ((int)((temp).size())); i++)
      if (temp[i].first == ht[cur].first &&
          leaves[temp[i].second].first > leaves[ht[cur].second].first)
        ht[cur] = temp[i];
    if ((int)((temp).size()) > 1) {
      damn = (ht[cur] != temp[0]) ? temp[0] : temp[1];
      for (i = (1); i < ((int)((temp).size())); i++)
        if (temp[i] != ht[cur] && temp[i].first == damn.first &&
            leaves[temp[i].second].first > leaves[damn.second].first)
          damn = temp[i];
      ans = max(ans, make_pair(damn.first + ht[cur].first,
                               make_pair(ht[cur].second, damn.second)));
    }
    if (pseudo_leaf[cur])
      ans = max(ans,
                make_pair(ht[cur].first + 1, make_pair(ht[cur].second, cur)));
  }
  ht[cur].first++;
  return;
}
void dfs(int cur, int par, int &a, int &b) {
  b++;
  a = cur;
  for (auto x : v[cur])
    if (mark[x] && x != par) dfs(x, cur, a, b);
  return;
}
void solve() {
  int n, i, a, b;
  cin >> n;
  for (i = (1); i < (n); i++) {
    cin >> a >> b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  for (i = (1); i < (n + 1); i++)
    if (!mark[i] && (int)((v[i]).size()) == 1) dfs(i);
  for (i = (1); i < (n + 1); i++)
    if (pseudo_leaf[i]) {
      temp.clear();
      for (auto x : v[i])
        if (mark[x]) {
          a = i;
          b = 0;
          dfs(x, i, a, b);
          temp.push_back(make_pair(b, a));
        }
      sort((temp).begin(), (temp).end(), greater<pair<int, int> >());
      leaves[i] = {temp[0].first + temp[1].first,
                   {temp[0].second, temp[1].second}};
    }
  root = 1;
  for (i = (1); i < (n + 1); i++)
    if (!mark[i]) {
      root = i;
      break;
    }
  ans = {0, {0, 0}};
  dfs(root, 0);
  cout << leaves[ans.second.first].second.first << " "
       << leaves[ans.second.second].second.first << '\n';
  cout << leaves[ans.second.first].second.second << " "
       << leaves[ans.second.second].second.second << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  clock_t clk;
  clk = clock();
  int t = 1, cs;
  cout << fixed << setprecision(9);
  for (cs = (1); cs < (t + 1); cs++) {
    solve();
  }
  clk = clock() - clk;
  cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
       << "\n";
  return 0;
}
