#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
vii a;
vi p,c;
void dfs(int x){
for(auto u:a[x])if(u!=p[x]){
c[x]++;
p[u]=x;
dfs(u);
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;cin>>n;
a.resize(n);p.resize(n,-1);c.resize(n,0);
REP(i,0,n-1){
int x,y;cin>>x>>y;
x--;y--;
a[x].PB(y);
a[y].PB(x);
}
dfs(0);
queue<int> q;
REP(i,0,n)if(c[i]==0)q.push(i);
int cnt=0;
vi ans(n);
REP(i,0,n)ans[i]=i;
while(!q.empty()){
int x=q.front();
q.pop();
if(ans[x]!=x){
if(x!=0){
c[p[x]]--;
if(c[p[x]]==0)q.push(p[x]);
}
continue;
}
cnt+=2;
if(x==0)swap(ans[x],ans[a[0][0]]);
else{
swap(ans[x],ans[p[x]]);
c[p[x]]--;
if(c[p[x]]==0)q.push(p[x]);
}
}
cout<<cnt<<" "<<cnt<<"\n";
for(auto u:ans)cout<<u+1<<" ";
cout<<"\n";
for(auto u:ans)cout<<u+1<<" ";
}
