Problem: You are given an unweighted tree with n vertices. Recall that a tree is a connected undirected graph without cycles.

Your task is to choose three distinct vertices a, b, c on this tree such that the number of edges which belong to at least one of the simple paths between a and b, b and c, or a and c is the maximum possible. See the notes section for a better understanding.

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

Input

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

Next n - 1 lines describe the edges of the tree in form a_i, b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i). It is guaranteed that given graph is a tree.

Output

In the first line print one integer res — the maximum number of edges which belong to at least one of the simple paths between a and b, b and c, or a and c.

In the second line print three integers a, b, c such that 1 ≤ a, b, c ≤ n and a ≠, b ≠ c, a ≠ c.

If there are several answers, you can print any.

Example

Input


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


Output


5
1 8 6

Note

The picture corresponding to the first example (and another one correct answer):

<image>

If you choose vertices 1, 5, 6 then the path between 1 and 5 consists of edges (1, 2), (2, 3), (3, 4), (4, 5), the path between 1 and 6 consists of edges (1, 2), (2, 3), (3, 4), (4, 6) and the path between 5 and 6 consists of edges (4, 5), (4, 6). The union of these paths is (1, 2), (2, 3), (3, 4), (4, 5), (4, 6) so the answer is 5. It can be shown that there is no better answer.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma optimize("TKACHENKO-GORYACHENKO")
#pragma GCC optimize("O3")
using namespace std;
const long long maxn = 1e6;
long long n, m, k, t;
long long ans = 0;
pair<pair<long long, long long>, long long> ansv;
vector<long long> V[maxn];
long long H[maxn];
long long HV[maxn];
void dfs(long long v, long long p) {
  HV[v] = v;
  H[v] = 1;
  for (auto v1 : V[v]) {
    if (v1 == p) {
      continue;
    }
    dfs(v1, v);
    if (H[v1] + 1 > H[v]) {
      H[v] = H[v1] + 1;
      HV[v] = HV[v1];
    }
  }
}
bool cmp(long long i, long long j) { return H[i] > H[j]; }
void dfs1(long long v, long long p, long long mxh, long long mxv) {
  long long q;
  long long dans;
  if (V[v].size() >= 3) {
    dans = mxh + H[V[v][1]] + H[V[v][2]];
    if (dans > ans) {
      ans = dans;
      ansv = make_pair(make_pair(HV[V[v][1]], HV[V[v][2]]), mxv);
    }
  }
  if (V[v].size() >= 4) {
    dans = H[V[v][1]] + H[V[v][2]] + H[V[v][3]];
    if (dans > ans) {
      ans = dans;
      ansv = make_pair(make_pair(HV[V[v][1]], HV[V[v][2]]), HV[V[v][3]]);
    }
  }
  if (V[v].size() == 2 && mxv != v) {
    dans = mxh + H[V[v][1]];
    if (dans > ans) {
      ans = dans;
      ansv = make_pair(make_pair(mxv, HV[V[v][1]]), v);
    }
  }
  for (q = 0; q < V[v].size(); q++) {
    long long v1 = V[v][q];
    if (v1 == p) {
      continue;
    }
    if (q == 1) {
      long long mxv1 = mxv;
      long long mx;
      if (V[v].size() >= 3) {
        if (H[V[v][2]] > mxh) {
          mxv1 = HV[V[v][2]];
        }
        mx = max(mxh, H[V[v][2]]);
      } else {
        mx = mxh;
      }
      dfs1(v1, v, mx + 1, mxv1);
      continue;
    }
    long long mxv1 = mxv;
    if (mxh < H[V[v][1]]) {
      mxv1 = HV[V[v][1]];
    }
    long long mx = max(mxh, H[V[v][1]]);
    dfs1(v1, v, mx + 1, mxv1);
  }
}
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long q, w, e, a, b, c, d;
  cin >> n;
  for (q = 0; q < n - 1; q++) {
    cin >> a >> b;
    a--;
    b--;
    V[a].push_back(b);
    V[b].push_back(a);
  }
  dfs(0, 0);
  V[0].push_back(0);
  for (q = 0; q < n; q++) {
    sort(V[q].begin(), V[q].end(), cmp);
  }
  dfs1(0, 0, 0, 0);
  cout << ans << endl;
  cout << ansv.first.first + 1 << " " << ansv.first.second + 1 << " "
       << ansv.second + 1 << endl;
  return 0;
}