#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 INF = 1e9;
        int ans = INF;

        int n;
        cin >> n;

        vector<map<int, int>> boxes(n);
        map<int, set<pair<int, int>>> other;

        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]++;
            }
            for (auto [x, y] : boxes[i]) {
                if (y > 1) {
                    ans = min(ans, int(boxes[i].size()) + 1);
                }
                other[x].emplace(y, i);
            }
        }

        for (int i = 0; i < n; i++) {
            vector<int> v;
            for (auto [x, y] : boxes[i]) {
                int need = INF;
                for (auto [c, j] : other[x]) {
                    if (i == j) {
                        continue;
                    }
                    need = c;
                    break;
                }
                v.push_back(need);
            }
            sort(v.rbegin(),v.rend());
            assert(v.size() == boxes[i].size());
            for (int j = 0; j < int(v.size()); j++) {
                ans = min(ans, v[j] + j + 1);
            }
        }

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