#include "bits/stdc++.h"

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1ll << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>

ll l = MINF, r = INF;
vector<ll> g[200100];
int main() {
    ll n;
    cin >> n;
    ll ans = 0;
    REP(i, n){
        ll k;
        cin >> k;
        REP(j, k){
            ll a;
            cin >> a;
            g[i].push_back(a);
        }
        sort(ALL(g[i]));
        ll nl = g[i][0];
        ll nr = g[i].back();
        l = max(l, nl);
        r = min(r, nr);
    }
    if(r <= l){
        cout << n << endl;
        return 0;
    }
    REP(i, n){
        REP(j, g[i].size()){
            if(l <= g[i][j] and g[i][j] <= r){
                cout << 2 * n - 1 << endl;
                return 0;
            }
        }
    }
    cout <<2 * n << endl;
}