#include <bits/stdc++.h>
using namespace std;

const int N = 100010;

bool vis[N];
vector<int> v[N];
int MAX, MAX_N;

void dfs(int x, int h)
{
    if (h > MAX) MAX = h, MAX_N = x;
    for (auto c : v[x])
        dfs(c, h + 1);
}

int main()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int k;
        cin >> k;
        while (k--)
        {
            int x;
            cin >> x;
            v[i].push_back(x);
            vis[x] = true;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (!vis[i]) //没有被标记的则是入口
            dfs(i, 1);
    }
    cout << MAX_N << endl;

    return 0;
}