#include<bits/stdc++.h>
using namespace std;


const int N = 500000+10;

struct dane {
    int pre;
    int w;
};

vector<dane> tab[N];




int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int maximum = 0;
    int k, n;
    cin>>k>>n;
    for(int i=0; i<n; i++) {
        dane d = {0, 0};
        tab[0].push_back(d);
    }
    for(int i=1; i<k; i++) {
        cin>>n;
        dane d;
        d.w = 0;
        for(int j = 0; j<n; j++) {
            cin>>d.pre;
            tab[i].push_back(d);
        }
    }
    //cout<<"K" << k<<endl;
    for(int i=k-1; i>=0; i--) {
            //cout<<"i"<<i<<endl;
        int temp = 0;
        for(int j = tab[i].size() - 1; j>=0; j--) {
            if(tab[i][j].w == 0) tab[i][j].w = 1;
            temp+=tab[i][j].w;
            int prev = tab[i][j].pre;
            if(prev != 0) {
                tab[i-1][prev-1].w += tab[i][j].w;
            }
        }
        //cout<<"temp "<<i<<": "<<temp<<"\n";
        maximum = max(maximum, temp);
    }
    cout<<maximum;
}