#include<cstdio>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
struct Tree{
	int n,rt,G;vector<int> Ux,Uy,ls,rs,s;vector<vector<int> > a,b;
	inline bool empty(int x){return a[x].empty()||b[x].empty();}
	inline void read(vector<int> U){
		scanf("%d",&n);Ux=Uy=U;ls=vector<int>(n,-1);rs=vector<int>(n,-1);a.resize(n);b.resize(n);
		for(int i=0,p,m1,m2;i<n;++i){
			scanf("%d%d%d",&p,&m1,&m2);a[i].resize(m1);b[i].resize(m2);
			if(p==i) rt=i;
			else if(ls[p]<0) ls[p]=i;else rs[p]=i;
			for(int j=0;j<m1;++j) scanf("%d",&a[i][j]);
			for(int j=0;j<m2;++j) scanf("%d",&b[i][j]);
			sort(a[i].begin(),a[i].end());sort(b[i].begin(),b[i].end());
		}
	}
	inline void print(){
		printf("%d\n",n);s.resize(n);s[rt]=rt;
		for(int i=0;i<n;++i) if(ls[i]>=0) s[ls[i]]=s[rs[i]]=i;
		for(int i=0;i<n;++i,putchar('\n')){
			printf("%d %llu %llu ",s[i],a[i].size(),b[i].size());
			for(int j=a[i].size();j--;) printf("%d ",a[i][j]);
			for(int j=b[i].size();j--;) printf("%d ",b[i][j]);
		}
	}
	void dfs(int nw){
		s[nw]=1;
		if(ls[nw]>=0) dfs(ls[nw]),s[nw]+=s[ls[nw]],dfs(rs[nw]),s[nw]+=s[rs[nw]];
		if(s[nw]*3>=n&&s[ls[nw]]<=n/3&&s[rs[nw]]<=n/3) G=nw;
	}
}Initial,emptytree;
inline vector<int> Intersect(vector<int> a,vector<int> b){
	vector<int> res;
	for(int i=0,sa=a.size(),j=0,sb=b.size();i<sa;++i){
		for(;j<sb&&b[j]<a[i];++j);
		if(j<sb&&b[j]==a[i]) res.push_back(a[i]);
	}
	return res;
}
inline vector<int> Complement(vector<int> a,vector<int> b){
	vector<int> res;
	for(int i=0,sa=a.size(),j=0,sb=b.size();i<sa;++i){
		for(;j<sb&&b[j]<a[i];++j);
		if(j==sb||b[j]-a[i]) res.push_back(a[i]);
	}
	return res;
}
Tree Restrict(Tree T,vector<int> A,vector<int> B){
	if(A.empty()||B.empty()) return emptytree;
	vector<int> mp(T.n,-1);queue<int> q;Tree res;
	for(int i=0;i<T.n;++i) T.a[i]=Intersect(T.a[i],A),T.b[i]=Intersect(T.b[i],B);
	q.push(T.rt);res.n=0;
	for(int x;!q.empty();q.pop()){
		mp[x=q.front()]=res.n++;
		for(;T.ls[x]>=0&&(T.empty(T.ls[x])||T.empty(T.rs[x]));)
			if(!T.empty(T.ls[x])) T.rs[x]=T.rs[T.ls[x]],T.ls[x]=T.ls[T.ls[x]];
			else if(!T.empty(T.rs[x])) T.ls[x]=T.ls[T.rs[x]],T.rs[x]=T.rs[T.rs[x]];
			else T.ls[x]=T.rs[x]=-1;
		if(T.ls[x]>=0) q.push(T.ls[x]),q.push(T.rs[x]);
	}
	res.Ux=A;res.Uy=B;res.rt=mp[T.rt];
	res.ls.resize(res.n);res.rs.resize(res.n);res.a.resize(res.n);res.b.resize(res.n);
	for(int i=0;i<T.n;++i) if(mp[i]>=0){
		res.a[mp[i]]=T.a[i];res.b[mp[i]]=T.b[i];
		if(T.ls[i]>=0) res.ls[mp[i]]=mp[T.ls[i]],res.rs[mp[i]]=mp[T.rs[i]];
		else res.ls[mp[i]]=res.rs[mp[i]]=-1;
	}
	return res;
}
Tree merge(Tree ls,Tree rs,vector<int> Ux,vector<int> Uy){
	if(!ls.n) return rs;
	if(!rs.n) return ls;
	Tree res;
	res.Ux=Ux;res.Uy=Uy;res.n=ls.n+rs.n+1;res.rt=0;
	res.ls.resize(res.n);res.rs.resize(res.n);res.a.resize(res.n);res.b.resize(res.n);
	res.a[res.rt]=Ux;res.b[res.rt]=Uy;
	res.ls[0]=1;res.rs[0]=ls.n+1;
	for(int i=0;i<ls.n;++i)
		res.a[i+1]=ls.a[i],res.b[i+1]=ls.b[i],res.ls[i+1]=ls.ls[i]+(ls.ls[i]>=0),res.rs[i+1]=ls.rs[i]+(ls.rs[i]>=0);
	for(int i=0,t=ls.n+1;i<rs.n;++i)
		res.a[i+t]=rs.a[i],res.b[i+t]=rs.b[i],res.ls[i+t]=rs.ls[i]+(rs.ls[i]>=0)*t,res.rs[i+t]=rs.rs[i]+(rs.rs[i]>=0)*t;
	return res;
}
Tree slv(Tree T){
	if(T.n<5) return T;
	T.s.resize(T.n);T.dfs(T.rt);
	vector<int> A=T.a[T.G],B=T.b[T.G],Ux=T.Ux,Uy=T.Uy;
	return merge(merge(slv(Restrict(T,A,B)),slv(Restrict(T,A,Complement(Uy,B))),A,Uy),slv(Restrict(T,Complement(Ux,A),Uy)),Ux,Uy);
}
int n;vector<int> U;
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;U.push_back(i++)) for(int j=0,a;j<n;++j) scanf("%d",&a);
	Initial.read(U);
	slv(Initial).print();
	return 0;
}