#include <bits/stdc++.h>
using namespace std;
pair<int, int> operator*(const pair<int, int> &p, const pair<int, int> &x) {
  pair<int, int> np = make_pair(p.first * x.first, p.second * x.second);
  return np;
}
pair<long long, long long> operator%(const pair<long long, long long> &p,
                                     const pair<long long, long long> &x) {
  pair<long long, long long> np =
      make_pair(p.first % x.first, p.second % x.second);
  return np;
}
pair<long long, long long> operator*(const pair<long long, long long> &p,
                                     const pair<int, int> &x) {
  pair<long long, long long> np =
      make_pair(p.first * x.first, p.second * x.second);
  return np;
}
pair<long long, long long> operator*(const pair<long long, long long> &p,
                                     const pair<long long, long long> &x) {
  pair<long long, long long> np =
      make_pair(p.first * x.first, p.second * x.second);
  return np;
}
pair<long long, long long> operator+(const pair<long long, long long> &p,
                                     const pair<long long, long long> &x) {
  pair<long long, long long> np =
      make_pair(p.first + x.first, p.second + x.second);
  return np;
}
pair<long long, long long> operator-(const pair<long long, long long> &p,
                                     const pair<long long, long long> &x) {
  pair<long long, long long> np =
      make_pair(p.first - x.first, p.second - x.second);
  return np;
}
pair<int, int> operator+(const pair<int, int> &p, const pair<int, int> &x) {
  pair<int, int> np = make_pair(p.first + x.first, p.second + x.second);
  return np;
}
pair<int, int> operator-(const pair<int, int> &p, const pair<int, int> &x) {
  pair<int, int> np = make_pair(p.first - x.first, p.second - x.second);
  return np;
}
vector<int> prime;
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second > b.second;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
long long powerm(long long a, long long k) {
  if (!k) {
    return 1;
  }
  long long b = powerm(a, k / 2);
  b = b * b % 998244353;
  if (k % 2) {
    return a * b % 998244353;
  } else {
    return b;
  }
}
long long power(long long a, long long b) {
  if (b == 1) return a;
  if (b == 0) return 1;
  long long m1 = power(a, b / 2);
  if (b % 2) return m1 * m1 * a;
  return m1 * m1;
}
void PFactor(long long n) {
  prime.clear();
  for (int i = 2; i <= n; i++) {
    while (n != i) {
      if (n % i)
        break;
      else
        prime.push_back(i), n /= i;
    }
  }
  prime.push_back(n);
}
bool isprime(long long a) {
  if (a <= 1) return false;
  if (a == 2 || a == 3) return true;
  if (a % 2 == 0 || a % 3 == 0) return false;
  for (long long i = 5; i * i <= a; i = i + 6) {
    if (a % i == 0 || a % (i + 2) == 0) return false;
  }
  return true;
}
const int N = 2e5 + 20;
vector<int> g[N];
vector<int> col[N];
int n = 0, m = 0, k = 0;
int a;
int b;
long long ans = 0;
int sum = 0;
int pos[N];
int color[N];
int cnt = 0;
int s;
int t = 0;
int c;
void paint(int u, int fa) {
  col[c].push_back(u);
  color[u] = c;
  for (auto v : g[u]) {
    if (v == fa) continue;
    paint(v, u);
  }
}
int dfs(int u, int fa) {
  int sz = 1;
  bool boo = true;
  for (auto v : g[u]) {
    if (v == fa) continue;
    int x = dfs(v, u);
    sz += x;
    if (x > n / 2) boo = false;
    ans += min(x, n - x) * 2;
  }
  if (n - sz > n / 2) boo = false;
  if (boo) s = u;
  return sz;
}
int getsz(int u, int fa) {
  int sz = 1;
  for (auto v : g[u]) {
    if (v == fa) continue;
    sz += getsz(v, u);
  }
  return sz;
}
vector<int> q;
void setrk(int u, int fa) {
  q.push_back(u);
  for (auto v : g[u]) {
    if (v == fa) continue;
    setrk(v, u);
  }
}
pair<int, int> rk[N];
int main() {
  cin >> n;
  for (int i = 2; i <= n; i++)
    scanf("%d", &a), scanf("%d", &b), g[a].push_back(b), g[b].push_back(a);
  dfs(1, 0);
  for (auto v : g[s]) rk[++cnt] = pair<int, int>(getsz(v, s), v);
  sort(rk + 1, rk + cnt + 1, sortinrev);
  for (int i = 1; i <= cnt; i++) c = i, paint(rk[i].second, s);
  col[cnt].push_back(s);
  for (int i = 2; i <= cnt; i++) setrk(rk[i].second, s);
  q.push_back(s);
  setrk(rk[1].second, s);
  int cntt = 0;
  for (auto u : q) {
    if (col[cntt].empty()) cntt++;
    int v = col[cntt][0];
    col[cntt][0] = col[cntt][(int)(col[cntt]).size() - 1],
    col[cntt].resize((int)(col[cntt]).size() - 1);
    pos[u] = v;
  }
  cout << ans << endl;
  for (int i = 1; i <= n; i++) cout << pos[i] << ' ';
}
