#include <bits/stdc++.h>
using namespace std;
int g[1200][1200];
int F[1200];
int o[1200],m;
int findfa(int x){
if(F[x] == x)return F[x];
return F[x] = findfa(F[x]);
}
void sum(int x,int y){
if(findfa(x) != findfa(y))
F[findfa(y)] = findfa(x);
}
int cmp(int a, int b){
return a>b;
}
int main(){
for(int i = 0; i <= 1000; i++)F[i]=i;
cin >> m;
int b[1200];
int n,t,k;
memset(o,0,sizeof(o));
for(int i = 0; i < m; i++){
cin >> n;
char c;
cin >> c >> k;
g[i][0] = k;
for(int j = 1; j < n; j++){
cin >> t;
g[i][j] = t;
sum(k,t);
}
}
int s = 0;
int e[1200]={0};
for(int i = 0; i < m; i++){
if(!e[findfa(g[i][0])])
s++;
e[findfa(g[i][0])] = 1;
o[findfa(g[i][0])]++;
}
sort(o,o+1200,cmp);
cout << s << endl;
for(int i = 0; i < 1200; i++){
if(o[i] == 0)break;
if(i == 0)cout << o[i];
if(i != 0) printf(" %d",o[i]);
}
return 0;
}