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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    auto solve = [&]() {
        constexpr int N = 1e5, INF = 1e9;
        int ans = INF;

        int n;
        cin >> n;

        vector<map<int, int>> boxes(n);
        array<array<int, 2>, N + 1> mn;
        mn.fill({INF, INF});

        for (int i = 0; i < n; i++) {
            int c;
            cin >> c;
            for (int j = 0; j < c; j++) {
                int x;
                cin >> x;
                boxes[i][x]++;
            }
            int sz = boxes[i].size();
            for (auto [x, y] : boxes[i]) {
                if (y > 1) {
                    ans = min(ans, sz + 1);
                }
                int k = sz;
                for (auto &l : mn[x]) {
                    if (k < l) {
                        swap(k, l);
                    }
                }
            }
        }

        for (int i = 0; i < n; i++) {
            vector<int> v;
            int sz = boxes[i].size();
            for (auto [x, y] : boxes[i]) {
                v.push_back(mn[x][sz == mn[x][0]]);
            }
            sort(v.rbegin(), v.rend());
            for (int j = 0; j < int(v.size()); j++) {
                ans = min(ans, v[j] + j + 1);
            }
        }

        cout << ans << '\n';
    };
    
    solve();
    
    return 0;
}