#include <bits/stdc++.h>

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbgR(...) 4242
#define dbgP(...) 420
#define dbgRP(...) 420420
void nline() {}
#endif

const int MX = 1440;

auto main() -> int {
  std::cin.tie(nullptr)->sync_with_stdio(false);

  int n;
  std::cin >> n;
  std::vector<std::vector<int>> adj(n);
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    std::cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }

  std::array<std::vector<bool>, 2> mv;
  mv[0].resize(MX + 1);
  mv[1].resize(MX + 1);
  std::vector<int> pow{1, 2, 4, 8, 16, 32, 50};
  int f = 0, num = 0, nxt = 1, ind = 0;
  for (int i = 1; i <= MX; ++i) {
    if (i % 2 == 1 && f == 0) {
      mv[0][i] = true;
      ++num;
    } else if (i % 2 == 0 && f == 1) {
      mv[1][i] = true;
      ++num;
    }
    if (num == nxt) {
      f = 1 - f;
      num = 0;
      ++ind;
      if (ind >= static_cast<int>(pow.size())) {
        nxt = pow.back();
      } else {
        nxt = pow[ind];
      }
    }
  }

  std::vector<int> sub(n);
  auto dfs = [&](auto &self, int node, int par) -> void {
    sub[node] = 1;
    for (int i : adj[node]) {
      if (i == par) {
        continue;
      }
      self(self, i, node);
      sub[node] += sub[i];
    }
  };
  dfs(dfs, 0, -1);
  int mid = 0;
  auto dfs2 = [&](auto &self, int node, int par) -> void {
    for (int i : adj[node]) {
      if (i == par) {
        continue;
      }
      if (sub[i] > n / 2) {
        self(self, i, node);
        return;
      }
    }
    mid = node;
  };
  dfs2(dfs2, 0, -1);

  // int t = (md + 1) / 2;
  // std::vector ans(n, std::vector<int>(t + 1));
  std::vector<std::vector<int>> ans(n);
  std::vector<int> a;
  std::vector<int> d(n);
  auto dfs3 = [&](auto &self, int node, int par) -> void {
    a.push_back(node);
    ans[node] = a;
    // std::reverse(ans[node].begin(), ans[node].end());
    for (int i : adj[node]) {
      if (i == par) {
        continue;
      }
      d[i] = d[node] + 1;
      self(self, i, node);
    }
    a.pop_back();
  };
  dfs3(dfs3, mid, -1);
  dbg(d);
  for (int i = 0; i < n; ++i) {
    std::reverse(ans[i].begin(), ans[i].end());
    while (static_cast<int>(ans[i].size()) < MX + 1) {
      ans[i].push_back(ans[i].back());
    }
  }
  std::cout << MX << '\n';
  for (int i = 0; i < 2; ++i) {
    for (int j = 0; j < n; ++j) {
      int ind = 0;
      for (int k = 1; k <= MX; ++k) {
        if (mv[i][k]) {
          ++ind;
        }
        std::cout << ans[j][ind] << ' ';
      }
      std::cout << '\n';
    }
  }
}