#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define mt make_tuple
#define mp make_pair
#define pb push_back
#define int long long
#define f first
#define s second
#define pll pair<long long, long long>
#define iii tuple<int,int,int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
signed main(){
int n;cin>>n;
vector<vector<int>> al(n+1);
for(int i=0;i<n-1;i++){
int a,b;cin>>a>>b;
al[a].pb(b);
al[b].pb(a);
}
vector<int> ss(n+1, 1);
int mn=0, mx=0;
vector<int> mncons(n+1, 0), mxcons(n+1, 0);
auto dfs=[&](auto && dfs, int x, int p)->void{
for(auto it : al[x]){
if(it==p)continue;
dfs(dfs, it, x);
ss[x] += ss[it];
}
if(mncons[x] == 0){
mn+=2;
if(p==0){
int ch=al[x][0];
mncons[x]=mncons[ch];
mncons[ch]=x;
}
else {
if(mncons[p] == 0){
mncons[x]=p;
mncons[p]=x;
}
else {
mncons[x]=mncons[p];
mncons[p]=x;
}
}
}
mx += 2*min(n-ss[x], ss[x]);
};
dfs(dfs, 1, 0);
cout<<mn<<" "<<mx<<'\n';
for(int i=1;i<=n;i++) cout<<mncons[i]<<" "; cout<<'\n';
for(int i=1;i<=n;i++) cout<<i<<" "; cout<<'\n';
}
