Problem: You are given an unweighted tree with n vertices. Then n - 1 following operations are applied to the tree. A single operation consists of the following steps: 

  1. choose two leaves; 
  2. add the length of the simple path between them to the answer; 
  3. remove one of the chosen leaves from the tree. 



Initial answer (before applying operations) is 0. Obviously after n - 1 such operations the tree will consist of a single vertex. 

Calculate the maximal possible answer you can achieve, and construct a sequence of operations that allows you to achieve this answer!

Input

The first line contains one integer number n (2 ≤ n ≤ 2·105) — the number of vertices in the tree. 

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

Output

In the first line print one integer number — maximal possible answer. 

In the next n - 1 lines print the operations in order of their applying in format ai, bi, ci, where ai, bi — pair of the leaves that are chosen in the current operation (1 ≤ ai, bi ≤ n), ci (1 ≤ ci ≤ n, ci = ai or ci = bi) — choosen leaf that is removed from the tree in the current operation. 

See the examples for better understanding.

Examples

Input

3
1 2
1 3


Output

3
2 3 3
2 1 1


Input

5
1 2
1 3
2 4
2 5


Output

9
3 5 5
4 3 3
4 1 1
4 2 2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long read() {
  long long a = 0, b = getchar(), c = 1;
  while (!isdigit(b)) c = b == '-' ? -1 : 1, b = getchar();
  while (isdigit(b)) a = a * 10 + b - '0', b = getchar();
  return a * c;
}
long long n, x, y, ans, d[3][200005];
vector<int> g, e[200005];
queue<int> q;
void bfs(long long *x, int b) {
  for (int i = 1; i <= n; i++) x[i] = -1;
  x[b] = 0, q.push(b);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int i = 0; i < e[u].size(); i++)
      if (x[e[u][i]] == -1) {
        x[e[u][i]] = x[u] + 1;
        q.push(e[u][i]);
      }
  }
}
int dfs(int u, int f, int t) {
  int z = 0;
  for (int i = 0; i < e[u].size(); i++)
    if (e[u][i] != f) z |= dfs(e[u][i], u, t);
  if (u == y) z = 1;
  if (t == 0 and z == 0) {
    g.push_back(u);
    g.push_back(d[1][u] > d[2][u] ? x : y);
    g.push_back(u);
    ans += max(d[1][u], d[2][u]);
  }
  if (t == 1 and z == 1 and f) {
    g.push_back(u);
    g.push_back(x);
    g.push_back(u);
    ans += d[1][u];
  }
  return z;
}
int main() {
  n = read();
  for (int i = 1; i < n; i++) {
    int u = read(), v = read();
    e[u].push_back(v);
    e[v].push_back(u);
  }
  bfs(d[0], 1);
  for (int i = 1; i <= n; i++)
    if (d[0][i] > d[0][x]) x = i;
  bfs(d[1], x);
  for (int i = 1; i <= n; i++)
    if (d[1][i] > d[1][y]) y = i;
  bfs(d[2], y);
  dfs(x, 0, 0), dfs(x, 0, 1);
  printf("%lld\n", ans);
  for (int i = 0; i < g.size(); i += 3)
    printf("%d %d %d\n", g[i], g[i + 1], g[i + 2]);
  return 0;
}