#include<bits/stdc++.h>
using namespace std;const int N=1e5+7;
int n,m,a[N],b[N],ans=1e9;vector<int>v[N];set<pair<int,int> >s[N];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		scanf("%d",&m);for(int j=1;j<=m;++j){
			scanf("%d",&a[j]);if(!b[a[j]])v[i].push_back(a[j]);b[a[j]]++;
		}
		for(int j=1;j<=m;++j)if(b[a[j]]){s[a[j]].insert({v[i].size(),i*(b[a[j]]==1)});b[a[j]]=0;}
	}
	for(int i=1;i<=n;++i){
		m=0;for(auto j:v[i]){
			a[++m]=1e9;for(auto k:s[j]){
				if(k.second==i)continue;
				a[m]=k.first+1;break;
			}
		}
		sort(a+1,a+m+1,greater<int>());
		for(int j=1;j<=m;++j)ans=min(ans,a[j]+j-1);
	}
	printf("%d\n",ans);
}