#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int M = 100'001;
vector<vector<int>> g(M);
vector<vector<int>> dp(M, vector<int>(2));
vector<int> rep(M), deg(M), p(M), sel(M), p2(M);
int Find(int v) {
return (rep[v]==v ? v : rep[v]=Find(rep[v]));
}
void Union(int a, int b){
rep[Find(a)] = Find(b);
}
void dfs(int v, int p) {
for(auto u : g[v]) if(u!=p) dfs(u,v);
dp[v][1] = dp[v][0] = 0;
for(auto u : g[v]) {
if(u==p) continue;
dp[v][0] += min(dp[u][0]+1, dp[u][1]);
dp[v][1] += dp[u][0]+1;
sel[v] = u;
}
for(auto u : g[v]) {
if(u==p) continue;
int val = dp[v][0]-min(dp[u][0]+1, dp[u][1]) + dp[u][0] + 1;
if(val < dp[v][1]) {
dp[v][1] = val;
sel[v] = u;
}
}
if(dp[v][1]==0) dp[v][1] = 1e9;
}
void add_edge(int a, int b) {
deg[a]++; deg[b]++;
Union(a,b);
}
void odzysk(int v, int p, int t) {
if(t==1) {
for(auto u : g[v]) {
if(u==p) continue;
if(dp[u][0]+1 < dp[u][1] || u==sel[v]) {
add_edge(u,v);
odzysk(u,v,0);
} else {
odzysk(u,v,1);
}
}
} else {
for(auto u : g[v]) {
if(u==p) continue;
if(dp[u][0]+1 < dp[u][1]) {
add_edge(u,v);
odzysk(u,v,0);
} else {
odzysk(u,v,1);
}
}
}
}
vector<int> is_off(M);
void del(int v) {is_off[v]=1;}
pair<ll, ll> f_dfs(int v, int p, int d) {
pair<ll, ll> ans = {d,v};
for(auto u : g[v]) {
if(u==p || is_off[u]) continue;
ans = max(ans,f_dfs(u,v,d+1));
}
return ans;
}
pair<ll, pair<ll, ll>> find_diam(int v) {
auto[d1,x] = f_dfs(v,0,0);
auto[d2,y] = f_dfs(x,0,0);
return {d2,{x,y}};
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
for(int i=0; i<M; ++i) rep[i] = i;
int n;
cin >> n;
for(int i=1; i<n; ++i) {
int a,b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
ll res = 2;
set<int> V;
for(int i=1; i<=n; ++i) V.insert(i);
while(V.size() > 3) {
auto[d,stat] = find_diam(*V.begin());
res += d;
auto[a,b] = stat;
del(a);
del(b);
p2[a] = b;
p2[b] = a;
V.erase(a); V.erase(b);
}
int x1 = *V.begin(); V.erase(x1);
int x2 = *V.begin(); V.erase(x2);
if(V.empty()) {
p2[x1] = x2;
p2[x2] = x1;
} else {
int x3 = *V.begin(); V.erase(x3);
p2[x1] = x2;
p2[x2] = x3;
p2[x3] = x1;
}
dfs(1,0);
odzysk(1,0,1);
vector<vector<int>> S(n+1);
for(int i=1; i<=n; ++i) {
S[rep[i]].push_back(i);
}
for(int i=1; i<=n; ++i) {
if(S[i].empty()) continue;
int c=0;
vector<int> vec;
for(auto x : S[i]) {
if(deg[x]==1) vec.push_back(x);
else c=x;
}
if(c==0) {
c=vec.back(); vec.pop_back();
}
while(vec.size() > 2) {
int a = vec.back(); vec.pop_back();
int b = vec.back(); vec.pop_back();
p[a] = b;
p[b] = a;
}
int a = vec.back(); vec.pop_back();
if(vec.empty()) {
p[a] = c;
p[c] = a;
continue;
}
int b = vec.back(); vec.pop_back();
p[a] = b;
p[b] = c;
p[c] = a;
}
cout << 2*dp[1][1] << " " << 2*res << "\n";
for(int i=1; i<=n; ++i) cout << p[i] << " "; cout << '\n';
for(int i=1; i<=n; ++i) cout << p2[i] << " "; cout << '\n';
return 0;
}
