#include <cstdio>
#include <algorithm>
using namespace std;
int d[5010];
inline bool porownaj(int a,int b){
        return a>b;
}
int main(){

        int n;
        scanf ("%d",&n);
                for (int i=1;i<=n;i++){
                        scanf ("%d",&d[i]);
                                int bu;
                for (int j=0;j<d[i];j++)
                        scanf ("%d",&bu);
                }
        sort(d+1,d+n+1,porownaj);

        int m;
        for (int i=1;i<=n;i++){
                if(d[i]>=i-1) m=i;
                else
                        break;
        }
        int moc=m;
        for (int i=1;i<=n;i++){
                if(d[i]>m-1)
                        moc--;
                if(d[i]==m-1&&i>m&&d[m]==m-1)
                        moc++;
        }
        for (int i=1;i<=n;i++){
                if(d[i]<m-1){
                        moc++;
                                break;
                        }
        }
printf ("%d\n",moc);

        return 0;
        }