#include <bits/stdc++.h>
#define endl '\n'

using namespace std;
constexpr int maxN = 500000;

vector<int> adj[maxN + 1];
int tree[maxN + 1];
int id = 0;

void dfs(int a) {
   for (int b : adj[a]) {
      dfs(b);
      tree[a] += tree[b];
   }
   if (tree[a] == 0) tree[a]++;
}

int main() {
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);

   int n; cin >> n;
   int total = 0;

   vector<vector<int>> arr(n);
   {
      int k; cin >> k;
      total += k;
      arr[0].assign(k, 0);
      for (int i = 0; i < k; i++) {
         arr[0][i] = ++id;
      }
   }

   for (int i = 1; i < n; i++) {
      int k; cin >> k;
      total += k;
      arr[i].assign(k, 0);
      for (int j = 0; j < k; j++) {
         int a; cin >> a;
         arr[i][j] = ++id;
         if (a == 0) continue;
         adj[arr[i - 1][a - 1]].push_back(id);
      }
   }

   int maxi = 0;

   for (int i = 0; i < n; i++) {
      int sum = 0;
      for (int j = 0; j < (int)arr[i].size(); j++) {
         if (tree[arr[i][j]] == 0) {
            dfs(arr[i][j]);
         }
         sum += tree[arr[i][j]];
         // cerr << tree[arr[i][j]] << ' ';
      }
      maxi = max(maxi, sum);
      // cerr << '\n';
   }

   cout << maxi << '\n';

   return 0;
}