Problem: You are given an undirected unweighted tree consisting of n vertices.

An undirected tree is a connected undirected graph with n - 1 edges.

Your task is to choose two pairs of vertices of this tree (all the chosen vertices should be distinct) (x_1, y_1) and (x_2, y_2) in such a way that neither x_1 nor y_1 belong to the simple path from x_2 to y_2 and vice versa (neither x_2 nor y_2 should not belong to the simple path from x_1 to y_1).

It is guaranteed that it is possible to choose such pairs for the given tree.

Among all possible ways to choose such pairs you have to choose one with the maximum number of common vertices between paths from x_1 to y_1 and from x_2 to y_2. And among all such pairs you have to choose one with the maximum total length of these two paths.

It is guaranteed that the answer with at least two common vertices exists for the given tree.

The length of the path is the number of edges in it.

The simple path is the path that visits each vertex at most once.

Input

The first line contains an integer n — the number of vertices in the tree (6 ≤ n ≤ 2 ⋅ 10^5).

Each of the next n - 1 lines describes the edges of the tree.

Edge i is denoted by two integers u_i and v_i, the labels of vertices it connects (1 ≤ u_i, v_i ≤ n, u_i ≠ v_i).

It is guaranteed that the given edges form a tree.

It is guaranteed that the answer with at least two common vertices exists for the given tree.

Output

Print any two pairs of vertices satisfying the conditions described in the problem statement.

It is guaranteed that it is possible to choose such pairs for the given tree.

Examples

Input

7
1 4
1 5
1 6
2 3
2 4
4 7


Output

3 6
7 5


Input

9
9 3
3 5
1 2
4 3
4 7
1 7
4 6
3 8


Output

2 9
6 8


Input

10
6 8
10 3
3 7
5 8
1 7
7 2
2 9
2 8
1 4


Output

10 6
4 5


Input

11
1 2
2 3
3 4
1 5
1 6
6 7
5 8
5 9
4 10
4 11


Output

9 11
8 10

Note

The picture corresponding to the first example: <image>

The intersection of two paths is 2 (vertices 1 and 4) and the total length is 4 + 3 = 7.

The picture corresponding to the second example: <image>

The intersection of two paths is 2 (vertices 3 and 4) and the total length is 5 + 3 = 8.

The picture corresponding to the third example: <image>

The intersection of two paths is 3 (vertices 2, 7 and 8) and the total length is 5 + 5 = 10.

The picture corresponding to the fourth example: <image>

The intersection of two paths is 5 (vertices 1, 2, 3, 4 and 5) and the total length is 6 + 6 = 12.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, a, b, cnt, root, head[200005], ma1[200005], ma2[200005], id1[200005],
    id2[200005], size[200005], val[200005];
bool isleaf[200005], f1[200005], f2[200005], used[200005];
struct node {
  int to, next;
} e[200005 << 1];
void insert(int u, int v) {
  e[++cnt].to = v;
  e[cnt].next = head[u];
  head[u] = cnt;
}
class Graph {
 public:
  int cnt, head[200005], deep[200005], ID, maxdeep, maxval, ans;
  struct edge {
    int to, next;
  } e[200005 << 1];
  void add(int u, int v) {
    e[++cnt].to = v;
    e[cnt].next = head[u];
    head[u] = cnt;
    e[++cnt].to = u;
    e[cnt].next = head[v];
    head[v] = cnt;
  }
  void dfs(int x, int fa) {
    if (deep[x] > maxdeep) {
      ID = x;
      maxdeep = deep[x];
      maxval = val[x];
    } else if (deep[x] == maxdeep && val[x] > maxval) {
      ID = x;
      maxval = val[x];
    }
    for (int i = head[x]; i; i = e[i].next)
      if (e[i].to ^ fa) {
        deep[e[i].to] = deep[x] + 1;
        dfs(e[i].to, x);
      }
  }
  void solve() {
    dfs(root, 0);
    root = ID;
    ID = 0;
    maxdeep = 0;
    maxval = 0;
    for (int i = 1; i <= n; i++) deep[i] = 0;
    dfs(root, 0);
    printf("%d %d\n", id1[root], id1[ID]);
    printf("%d %d\n", id2[root], id2[ID]);
  }
} G;
void dfs_leaf(int x, int fa) {
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to ^ fa) {
      dfs_leaf(e[i].to, x);
      size[x]++;
    }
  if (size[x] + (fa != 0) >= 3) isleaf[x] = 1;
}
void dfs_underleaf(int x, int fa) {
  if (isleaf[x]) f1[x] = 1;
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to ^ fa) {
      dfs_underleaf(e[i].to, x);
      if (f1[e[i].to]) f1[x] = 1;
    }
}
void dfs_upperleaf(int x, int fa) {
  if (isleaf[x]) f2[x] = 1;
  int res = 0;
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to ^ fa && f1[e[i].to]) res++;
  if (res >= 2 || f1[x] && f2[x]) used[x] = 1;
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to ^ fa) {
      if (f2[x] || res - f1[e[i].to] > 0) f2[e[i].to] = 1;
    }
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to ^ fa) dfs_upperleaf(e[i].to, x);
}
void dfs_link(int x, int fa) {
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to ^ fa) {
      dfs_link(e[i].to, x);
      if (used[e[i].to] && used[x]) G.add(x, e[i].to);
    }
}
void dfs_val(int x, int fa) {
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to ^ fa && !used[e[i].to]) {
      dfs_val(e[i].to, x);
      int tmp = ma1[e[i].to] + 1;
      if (tmp > ma1[x])
        ma2[x] = ma1[x], id2[x] = id1[x], ma1[x] = tmp, id1[x] = id1[e[i].to];
      else if (tmp > ma2[x])
        ma2[x] = tmp, id2[x] = id1[e[i].to];
    }
  if (!ma1[x]) id1[x] = x;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &a, &b);
    insert(a, b);
    insert(b, a);
  }
  dfs_leaf(1, 0);
  dfs_underleaf(1, 0);
  dfs_upperleaf(1, 0);
  dfs_link(1, 0);
  for (int i = 1; i <= n; i++)
    if (used[i]) {
      if (!root) root = i;
      dfs_val(i, 0);
      if (ma2[i]) val[i] = ma1[i] + ma2[i];
    }
  G.solve();
  return 0;
}