#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef pair<int32_t, int32_t> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 100010
#define INF (ll)1e9+10
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;
int N,a,b,c;
vi adj[maxn];
int maxans[maxn];
vi A[maxn];
int sz[maxn], depth[maxn];
void dfs(int x,int p){
sz[x] = 1;
aFOR(i,adj[x]) if (i != p){
depth[i] = depth[x] + 1;
dfs(i,x);
sz[x] += sz[i];
}
}
int minans[maxn], minval = 0;
void getmin(int x,int p){
aFOR(i,adj[x]) if (i != p){
getmin(i,x);
if (minans[i] == i){
minval += 2; swap(minans[i], minans[x]);
}
}
if (minans[x] == x && adj[x].size() - (p != -1) != 0){
minval += 2;
aFOR(i,adj[x]) if (i != p){
swap(minans[i], minans[x]); break;
}
}
}
int get_cent(int x,int p){
aFOR(i,adj[x]) if (i != p && sz[i] > N/2) return get_cent(i,x);
return x;
}
vi v;
void get_set(int x,int p,int y){
v.pb(x);
aFOR(i,adj[x]) if (i != p) get_set(i,x,y);
}
int32_t main(){
fast;
cin >> N;
FOR(i,1,N-1){
cin >> a >> b; adj[a].pb(b); adj[b].pb(a);
}
dfs(1,-1);
FOR(i,1,N) minans[i] = i;
getmin(1,-1);
int cent = get_cent(1,-1);
depth[cent] = 0;
dfs(cent,-1);
int maxval = 0;
FOR(i,1,N) maxval += 2*min(sz[i], N - sz[i]);
int mxsz = 1;
aFOR(i,adj[cent]){
get_set(i, cent, i); mxsz = max(mxsz, sz[i]);
}
v.pb(cent);
vi v2;
aFOR(i,v) v2.pb(i);
rotate(v2.begin(), v2.begin() + mxsz, v2.end());
FOR(i,0,v.size()-1) maxans[v[i]] = v2[i];
cout << minval << ' ' << maxval << '\n';
FOR(i,1,N) cout << minans[i] << ' '; cout << '\n';
FOR(i,1,N) cout << maxans[i] << ' ';
}
