#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


/*
  point or [min, max]
*/

int N;
vector<int> K;
vector<vector<int>> A;

int main() {
  for (; ~scanf("%d", &N); ) {
    K.resize(N);
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &K[i]);
      A[i].resize(K[i]);
      for (int k = 0; k < K[i]; ++k) {
        scanf("%d", &A[i][k]);
      }
      sort(A[i].begin(), A[i].end());
    }
    
    vector<pair<int, int>> lis, ris;
    for (int i = 0; i < N; ++i) {
      lis.emplace_back(A[i][0], i);
      ris.emplace_back(A[i][K[i] - 1], i);
    }
    sort(lis.begin(), lis.end());
    sort(ris.begin(), ris.end());
    
    // point vs [min, max]
    vector<vector<int>> can(N);
    for (int i = 0; i < N; ++i) {
      can[i].assign(K[i], 1);
      for (int k = 0; k < K[i]; ++k) {
        // max r s.t. r < a
        {
          auto it = lower_bound(ris.begin(), ris.end(), make_pair(A[i][k], -1));
          if (it != ris.begin()) {
            --it;
            if (A[i][0] < it->first) can[i][k] = 0;
          }
        }
        // min l s.t. a < l
        {
          auto it = lower_bound(lis.begin(), lis.end(), make_pair(A[i][k], -1));
          if (it != lis.end()) {
            if (it->first < A[i][K[i] - 1]) can[i][k] = 0;
          }
        }
      }
    }
// cerr<<"can = "<<can<<endl;
    
    // point vs point: disjoint intervals
    vector<pair<int, int>> rls;
    for (int i = 0; i < N; ++i) for (int k = 0; k < K[i]; ++k) if (can[i][k]) rls.emplace_back(A[i][K[i] - 1], A[i][k]);
    sort(rls.begin(), rls.end());
    int ans = 0;
    {
      int r = 0;
      for (const auto &rl : rls) if (r < rl.second) {
        ++ans;
        r = rl.first;
      }
    }
    ans = 2 * N - ans;
    printf("%d\n", ans);
  }
  return 0;
}