#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n;
set<int> a[N];
multiset<int> val[N];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    int ans = 1e9;
    for (int i = 1, k; i <= n; ++i) {
        cin >> k;
        set<int> st;
        int flag = 0;
        for (int j = 1, x; j <= k; ++j) {
            cin >> x;
            if (a[i].count(x)) flag = 1; else a[i].insert(x);
        }
        if (flag) ans = min<int>(ans, a[i].size() + 1);
        for (auto x : a[i]) val[x].insert(a[i].size());
    }
    for (int i = 1; i <= n; ++i) {
        for (auto x : a[i]) val[x].erase(val[x].find(a[i].size()));
        vector<int> vec;
        int tot = 0;
        for (auto x : a[i]) {
            if (val[x].size()) vec.push_back(*val[x].begin());
            else ++tot; 
        }
        sort(vec.begin(), vec.end(), greater<int>());
        for (int j = 0; j < vec.size(); ++j) ans = min(ans, tot + j + 1 + vec[j]);
        for (auto x : a[i]) val[x].insert(a[i].size());
    }
    cout << ans << endl;
    return 0;
}