#include <iostream>
#include <vector>

using namespace std;
using ll = long long;

const int MAX_N = 107;

int n;
vector<int> graph[MAX_N];
ll state[MAX_N];

void init() {
    cin >> n;

    for (int i = 1; i <= n; i++) {
        int m;
        cin >> m;

        for (int j = 0; j < m; j++) {
            int v;
            cin >> v;

            graph[i].push_back(v);
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    init();

    ll result = 0;
    ll reset = n;

    do {
        result++;
        int v = 1;

        while (graph[v].size() > 0) {
            int u = v;
            v = graph[v][state[v]];
            int ps = state[u];
            state[u] = (state[u] + 1) % graph[u].size();

            if (ps > 0 && state[u] == 0)
                reset++;
            else if (ps == 0 && state[u] == 1)
                reset--;
        }
    } while (reset < n);

    cout << result << '\n';

    return 0;
}