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;
vector<int> degree;
vector<vector<int>> adj;
vector<int> dist;
vector<int> parent;
void dfs(int node, int par) {
  dist[node] = par < 0 ? 0 : dist[par] + 1;
  parent[node] = par;
  for (int neighbor : adj[node])
    if (neighbor != par) dfs(neighbor, node);
}
int find_farthest(int node) {
  dfs(node, -1);
  int far = -1;
  for (int i = 0; i < N; i++)
    if (degree[i] >= 3 && (far == -1 || dist[i] > dist[far])) far = i;
  return far;
}
void erase_edge(int a, int b) {
  adj[a].erase(find(adj[a].begin(), adj[a].end(), b));
  adj[b].erase(find(adj[b].begin(), adj[b].end(), a));
}
const int INF = 1e9 + 5;
struct dp_state {
  int deep;
  int far_sum;
  int far1, far2;
  int far3, far4;
  int farthest;
  dp_state()
      : deep(-INF),
        far_sum(-INF),
        far1(-INF),
        far2(-INF),
        far3(-INF),
        far4(-INF),
        farthest(-INF) {}
  bool operator<(const dp_state &other) const {
    if (deep != other.deep) return deep < other.deep;
    return far_sum < other.far_sum;
  }
  dp_state operator+(const dp_state &other) const {
    dp_state sum;
    sum.deep = deep + other.deep;
    sum.far_sum = far_sum + other.far_sum;
    sum.far1 = far1;
    sum.far2 = far2;
    sum.far3 = other.far1;
    sum.far4 = other.far2;
    return sum;
  }
};
dp_state best;
int get_dist(int num) { return num < 0 ? -INF : dist[num]; }
bool better(int candidate, int far) {
  return get_dist(candidate) > get_dist(far);
}
dp_state extend(dp_state state) {
  state.deep++;
  state.far_sum += 2;
  return state;
}
dp_state attach(dp_state root, dp_state child, int node) {
  best = max(best, root + child);
  if (child.deep >= 0 && root < child) {
    root = child;
  } else if (root.deep < 0) {
    if (better(child.farthest, root.far1)) {
      root.far2 = root.far1;
      root.far1 = child.farthest;
    } else if (better(child.farthest, root.far2)) {
      root.far2 = child.farthest;
    }
    root.far_sum = get_dist(root.far1) + get_dist(root.far2) - 2 * dist[node];
  }
  if (better(child.farthest, root.farthest)) root.farthest = child.farthest;
  return root;
}
dp_state solve(int node, int par) {
  dp_state root;
  root.farthest = node;
  root.far_sum = 0;
  for (int neighbor : adj[node])
    if (neighbor != par) {
      dp_state child = solve(neighbor, node);
      root = attach(root, extend(child), node);
    }
  if (degree[node] >= 3) root.deep = max(root.deep, 0);
  return root;
}
int main() {
  scanf("%d", &N);
  degree.assign(N + 1, 0);
  adj.assign(N + 1, {});
  for (int i = 0; i < N - 1; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
    degree[u]++;
    degree[v]++;
  }
  dist.resize(N + 1);
  parent.resize(N + 1);
  int index = -1;
  for (int i = 0; i < N; i++)
    if (degree[i] >= 3) index = i;
  assert(index >= 0);
  int A = find_farthest(index);
  int B = find_farthest(A);
  assert(dist[A] == 0);
  assert(A != B);
  int root = -1;
  if (parent[B] == A) {
    erase_edge(A, B);
    adj[N].push_back(A);
    adj[N].push_back(B);
    degree[N] = 2;
    root = N;
  } else {
    int iterations = dist[B] / 2;
    root = B;
    while (iterations-- > 0) root = parent[root];
  }
  cerr << "solve root: " << root << endl;
  best = dp_state();
  dfs(root, -1);
  solve(root, -1);
  printf("%d %d\n", best.far1 + 1, best.far3 + 1);
  printf("%d %d\n", best.far2 + 1, best.far4 + 1);
}