#include <bits/stdc++.h>
using namespace std; 
const int INF = 1e9; 
const int N = 1e5 + 5; 

int n, L[N], mn[N][2]; 
map<int, int> a[N]; 
vector<int> lck[N]; 

void solve(void) {
    int ans = INF;

    cin >> n;
    for (int i = 0; i < n; ++i) a[i].clear(); 
    
    memset(mn, 0x3f, sizeof mn); 

    for (int i = 0; i < n; ++i) {
        int len; cin >> len; 
        for (int j = 0, x; j < len; ++j) cin >> x, ++a[i][x]; 
        int sz = a[i].size(); 
        for (auto [x, y] : a[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 = a[i].size();
        for (auto [x, y] : a[i]) {
            v.push_back(mn[x][sz == mn[x][0]]);
        }
        sort(v.begin(), v.end(), greater<int>());
        for (int j = 0; j < v.size(); ++j) ans = min(ans, v[j] + j + 1); 
    }
    cout << ans << '\n';
}

int main(void) {
    ios::sync_with_stdio(0); 
    int T = 1; // cin >> T; 
    while (T--) solve();
    return 0;
}