#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
namespace checker{
	int n,L;
	vector <int> G[505];
	int _u[505],_v[505],ans[2][505][3005],dis[505][505];
	void chk(int u,int v){
		for(int p:G[u]) if(p == v) return;
		assert(u == v);
	}
	void slv(){
		memset(dis,0x3f,sizeof(dis));
		rep(u,1,n) dis[u][u] = 0;
		rep(i,1,n - 1){
			_u[i]++;_v[i]++;
			dis[_u[i]][_v[i]] = dis[_v[i]][_u[i]] = 1;
			G[_u[i]].eb(_v[i]);
			G[_v[i]].eb(_u[i]);
		}
		rep(k,1,n){
			rep(u,1,n){
				rep(v,1,n) chkmin(dis[u][v],dis[u][k] + dis[k][v]);
			}
		}
		rep(u,1,n){
			ans[0][u][0] = u;
			rep(i,1,L){
				assert(0 <= ans[0][u][i] && ans[0][u][i] < n);
				ans[0][u][i]++;
			}
		}
		rep(u,1,n){
			ans[1][u][0] = u;
			rep(i,1,L){
				assert(0 <= ans[1][u][i] && ans[1][u][i] < n);
				ans[1][u][i]++;
			}
		}

		rep(u,1,n){
			rep(i,1,L){
				if(i % 2) chk(ans[0][u][i],ans[0][u][i - 1]);
				else assert(ans[0][u][i] == ans[0][u][i - 1]);
			}
			rep(i,1,L){
				if(i % 2 == 0) chk(ans[1][u][i],ans[1][u][i - 1]);
				else assert(ans[1][u][i] == ans[1][u][i - 1]);
			}
		}

		db rat = 0;
		rep(u,1,n){
			rep(v,1,n){
				if(u == v) continue;
				int cur = inf;
				rep(i,0,L){
					if(ans[0][u][i] == ans[1][v][i]){
						cur = i;
						break;
					}
				}
				assert(cur != inf);
				chkmax(rat,cur * 1.0 / dis[u][v]);
			}
		}
		cerr << rat << "\n";
	}
}

int n;
vector <int> G[105];

int anc[105][105],fa[105];
void dfs(int u,int f){
	fa[u] = f;
	for(int v:G[u]) if(v != f) dfs(v,u);
	int p = u,k = 0;
	while(p){
		anc[u][k] = p;
		p = fa[p];
		k++;
	}
}

void report(int op,int u,int pos,int v){
	printf("%d ",v - 1);
	checker::ans[op][u][pos] = v - 1;
}
const int k = 6;
int a[7] = {0,1,5,12,23,36,36};
int main(){	
//	freopen("test.in","r",stdin);
//	freopen("test.out","w",stdout);
	scanf("%d",&n);
	checker::n = n;
	rep(i,1,n - 1){
		int u,v;
		scanf("%d%d",&u,&v);
		checker::_u[i] = u;checker::_v[i] = v;
		u++;v++;
		G[u].eb(v);G[v].eb(u);
	}
	dfs(1,0);
	printf("1440\n");
	rep(u,1,n){
		int cur = 0,pos = 0;
		rep(i,1,k){
			rep(j,1,2 * a[i] - 1){
				++pos;
				if(pos % 2){
					if(i % 2 == 1) cur++;
					else cur = max(cur - 1,0);					
				}
				report(0,u,pos,max(1,anc[u][cur]));
			}
		}
		while(pos < 1440){
			++pos;
			if(pos % 2) cur = min(cur + 1,n);
			report(0,u,pos,max(1,anc[u][cur]));
		}
		printf("\n");
	}
	rep(u,1,n){
		int cur = 0,pos = 0;
		rep(i,1,k){
			rep(j,1,2 * a[i] - 1){
				++pos;
				if(pos % 2 == 0){
					if(i % 2 == 0) cur++;
					else cur = max(cur - 1,0);					
				}
				report(1,u,pos,max(1,anc[u][cur]));
			}
		}
		while(pos < 1440){
			++pos;
			if(pos % 2 == 0) cur = min(cur + 1,n);
			report(1,u,pos,max(1,anc[u][cur]));
		}		
		printf("\n");
	}
	checker::L = 1440;
	checker::slv();
	return 0;
}