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
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
    o << "{";
    for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
    return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
    return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) {}
#endif

#define x first
#define y second
#define ir(a, x, b) ((a) <= (x) && (x) <= (b))
#define vec vector
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()

using ll = long long;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int K; cin >> K;
  vec<vec<int>> ct(K);
  vec<vec<int>> ps(K);
  int n0; cin >> n0;
  ct[0].resize(n0);
  rep (k, 1, K) {
    int N; cin >> N;
    debug(N);
    ct[k].resize(N);
    ps[k].resize(N);
    rep (n, 0, N) cin >> ps[k][n];
  }

  ll res = 0;
  for (int k = K-1; k >= 0; k--) {
    ll sum = 0;
    int N = ct[k].size();
    rep (n, 0, N) {
      ct[k][n] = max(ct[k][n], 1);
      sum += ct[k][n];

      if (k > 0 && ps[k][n] > 0) {
        ct[k-1][ps[k][n]-1] += ct[k][n];
      }
    }

    res = max(sum, res);
  }
  debug(ct);
  cout << res << "\n";
  return 0;
}