1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <vector>
#include <iostream>
#include <sstream>
#include <math.h>
#include <sys/time.h>
#include <cstdlib>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <set>
#include <map>
#include <iomanip>
#include <queue>

#define FOR(i,a,b)  for(__typeof(b) i=(a);i<(b);++i)
#define REP(i,a)    FOR(i,0,a)
#define FOREACH(x,c)   for(__typeof(c.begin()) x=c.begin();x != c.end(); x++)
#define ALL(c)      c.begin(),c.end()
#define CLEAR(c)    memset(c,0,sizeof(c))
#define SIZE(c) (int) ((c).size())

#define PB          push_back
#define MP          make_pair
#define X           first
#define Y           second

#define ULL         unsigned long long
#define LL          long long
#define LD          long double
#define II         pair<int, int>
#define DD         pair<double, double>
#define FF          pair<float,float>

#define VC	    vector
#define VI          VC<int>
#define VVI         VC<VI>
#define VVVI        VC<VVI>
#define VD          VC<double>
#define VS          VC<string>
#define VII         VC<II>
#define VDD         VC<DD>
#define VFF         VC<FF>
#define VVD         VC<VD>
#define VVVD        VC<VVD>
#define VULL         VC<ULL>

#define DB(a)       cerr << #a << ": " << a << endl;

using namespace std;

template<class T> void print(VC < T > v) {cerr << "[";if (SIZE(v) != 0) cerr << v[0]; FOR(i, 1, SIZE(v)) cerr << "," << v[i]; cerr << "]\n";}
template<class T> string i2s(T &x) { ostringstream o; o << x; return o.str(); }
VS split(string &s, char c = ' ') {VS all; int p = 0, np; while (np = s.find(c, p), np >= 0) {all.PB(s.substr(p, np - p)); p = np + 1;} if (p < SIZE(s)) all.PB(s.substr(p)); return all;}

vector<vector<II>> T; // prev, cnt

int main(int argc, char *argv[]){
    int K;
    cin >> K;
    T.resize(K);
    int N;
    cin >> N;
    T[0] = vector<II>(N,MP(0,0));
    REP(k,K-1){
        cin >> N;
        T[k+1].resize(N);
        REP(i,N){
            T[k+1][i] = MP(0,0);
            cin >> T[k+1][i].X;
        }
    }
    int M = 0;
    for(int k = K-1; k >= 0; k--){
        int m = 0;
        for(auto s : T[k]){
            if (s.Y == 0)
                s.Y = 1;
            m += s.Y; 
            if (s.X != 0)
                T[k-1][s.X-1].Y += s.Y;
        }
        M = max(M,m);
    }
    cout << M << endl;
    return 0;
}