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
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
template<class T>
using vec = vector<T>;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KoRoVa
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = -1, inf = 1000111222;

void test_case() {
    int k, n1;
    cin >> k >> n1;
    vector<int> n(k + 1);
    vector<vector<int> > a(k + 1);
    n[1] = n1;
    for (int day = 2; day <= k; day++) {
        cin >> n[day];
        a[day].resize(n[day] + 1);
        for (int i = 1; i <= n[day]; i++) {
            cin >> a[day][i];
        }
    }
    vector<int> need(n[k] + 1, 1);
    int ans = n[k];
    for (int day = k; day >= 2; day--) {
        vector<int> sum(n[day - 1] + 1, 0);
        for (int i = 1; i <= n[day]; i++) {
            if (a[day][i] != 0) {
                sum[a[day][i]] += need[i];
            }
        }
        vector<int> prev_need(n[day - 1] + 1, 1);
        int cur_sum = 0;
        for (int i = 1; i <= n[day - 1]; i++) {
            prev_need[i] = max(1, sum[i]);
            cur_sum += prev_need[i];
        }
        umax(ans, cur_sum);
        need.swap(prev_need);
    }
    cout << ans << '\n';
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;

//    cin >> t;

    while (t--) test_case();

    return 0;
}

/*
KoRoVa!
*/