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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#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(...) 2137
#endif

int main() {
  cin.tie(0)->sync_with_stdio(0);
  
  int n;
  cin >> n;
  vector<vector<int>> v(n);
  vector<vector<int>> s(n);
  int k;
  cin >> k;
  s[0] = v[0] = vector<int>(k);
  for(int i = 1; i < n; i++) {
    cin >> k;
    for(int j = 0; j < k; j++) {
      int x;
      cin >> x;
      v[i].push_back(x);
    }
    s[i].resize(v[i].size());
  }
  int ans = 0;
  for(int i = n - 1; i >= 0; i--) {
    int sm = 0;
    for(int j = 0; j < s[i].size(); j++) {
      if(!s[i][j]) s[i][j]++;
      sm += s[i][j];
      if(v[i][j]) s[i - 1][v[i][j] - 1] += s[i][j];
    }
    ans = max(ans, sm);
  }
  cout << ans << endl;
}