pat甲级1107

using namespace std;
const int maxn = 1000+5;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
const int MOD = 1e9+7;
const int sqrN = 316;
typedef long long ll;
#define pb push_back
#define pp pop_back
#define lowbit(x) ((x)&(-x))
#define mst(a,b) memset(a,b,sizeof(a)) 

int pre[maxn],hobby[maxn],res[maxn];
void () {
	for (int i = 1; i <= maxn; ++i) pre[i] = i; 
} 
int find(int x) {
	if (x == pre[x]) return x;
	else {
		int r = find(pre[x]);
		pre[x] = r;
		return r;
	}
}
void Union(int a,int b) {
	int Ra = find(a);
	int Rb = find(b);
	if (Ra != Rb) pre[Ra] = Rb;
}

int main() {
#ifdef ONLIGE_JUDGE
#else
    freopen("H:\in.txt","r",stdin);
#endif 
	makeSet();
	int n,t,cnt = 0;
	scanf("%d",&n);
	for (int i = 1, k; i <= n; ++i) { 
		scanf("%d:",&k); 
		for (int j = 1; j <= k; ++j) {
			scanf("%d",&t); 
			if (!hobby[t]) hobby[t] = i; //如果在i喜欢之前没人喜欢，则喜欢t的人为i. 
			Union(i,find(hobby[t])); //将当前喜欢t的人与之前喜欢t的融入一个圈子 
		}
	}	
	for (int i = 1; i <= n; ++i) {
		res[find(i)]++;
	}
	for (int i = 1; i <= n; ++i) {
		if (res[i]) cnt++;
	}
	cout << cnt << endl;
	sort(res+1,res+n+1,greater<int>()); // res从1开始 
	for (int i = 1; i <= cnt; ++i)
		printf("%d%c",res[i],i==cnt ? 'n' : ' ');
	return 0; 
}