#include<iostream>
#include<map>
#include<cstring>
#include<vector>
#include<set>
using namespace std;
const int N=100010;
map<int,int> mp[N],times[N];
int minn[N],minnn[N];
int n;
int l[N];
vector<int> g[N];
int main()
{
    memset(minn,0x3f,sizeof(minn));
    memset(minnn,0x3f,sizeof(minnn));
    cin>>n;
    int ans=1e9;
    for(int i=1;i<=n;i++)
    {
        cin>>l[i];
        set<int> s;
        for(int j=1;j<=l[i];j++)
        {
            int x;
            cin>>x;
            s.insert(x);
            g[i].push_back(x);
        }
        int now=s.size();
        for(int it:g[i])
        {
            mp[i][it]=now;
            if(now<minn[it])
            {
                minnn[it]=minn[it];
                minn[it]=now;
            }
            else if(now<minnn[it])
                minnn[it]=now;
            times[i][it]++;
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int it:g[i])
        {
            if(mp[i][it]==minn[it])
                ans=min(ans,mp[i][it]+minnn[it]);
            else
                ans=min(ans,mp[i][it]+minn[it]);
            if(times[i][it]>1)
                ans=min(ans,mp[i][it]+1);
        }
    }
    cout<<ans;
}