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

-1
 9
 1
 1
 3
 3
 -1
 -1
 1
 1
 1
 5
 1
 5
 -1

#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - 48;
    ch = getchar();
  }
  return x * f;
}
const int N = 2e5 + 11;
struct node {
  int to, pre;
} e[2 * N];
int n, m, S, T, tot, cnt, ans;
int head[N], dep[N], f[N], a[N], son[N];
inline void add(int x, int y) {
  e[++cnt].to = y;
  e[cnt].pre = head[x];
  head[x] = cnt;
}
inline void dfs(int u, int fa) {
  f[u] = fa;
  for (int i = head[u]; i; i = e[i].pre) {
    int v = e[i].to;
    if (v != fa) {
      dep[v] = dep[u] + 1;
      dfs(v, u);
    }
  }
}
inline void dfs_2(int u, int fa) {
  for (int i = head[u]; i; i = e[i].pre) {
    int v = e[i].to;
    if (v != fa) {
      son[u]++;
      dfs_2(v, u);
      dep[u] = max(dep[v] + 1, dep[u]);
    }
  }
  bool flag = 0;
  for (int i = head[u]; i; i = e[i].pre) {
    int v = e[i].to;
    if (v != fa)
      if (dep[v] + 1 != dep[u]) flag = 1;
  }
  if (son[u] == 2 && flag == 0) dep[u]--;
}
inline int calc(int root) {
  for (int i = 1; i <= n; i++) dep[i] = 0, son[i] = 0;
  dfs_2(root, -1);
  return dep[root];
}
int main() {
  n = read();
  if (n <= 2) {
    printf("%d\n", n);
    return 0;
  }
  for (int i = 1; i <= n - 1; i++) {
    int x, y;
    ;
    x = read();
    y = read();
    add(x, y);
    add(y, x);
  }
  dfs(1, -1);
  dep[0] = -1;
  S = 0;
  for (int i = 1; i <= n; i++)
    if (dep[S] < dep[i]) S = i;
  for (int i = 1; i <= n; i++) dep[i] = 0, f[i] = 0;
  dfs(S, -1);
  dep[0] = -1;
  for (int i = 1; i <= n; i++)
    if (dep[T] < dep[i]) T = i;
  int x = T;
  a[++tot] = T;
  printf("%d %d\n", S, T);
  while (f[x] != -1) {
    a[++tot] = f[x];
    x = f[x];
  }
  if (tot & 1)
    ans = calc(a[tot / 2]);
  else
    ans = max(calc(a[tot / 2]), calc(a[tot / 2 + 1]));
  printf("%d\n", ans);
  return 0;
}
