// Author: Klay Thompson
// Problem: F. Magical Bags
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 200010;

int n, m, sz, c[maxn], vis[maxn], mn[maxn];
pii a[maxn], b[maxn];

bool check(int x, int y) {
  if (b[x].fi >= b[y].se) return false;
  if (b[y].fi >= b[x].se) return false;
  return true;
}

int g(pii x) {
  return x.fi == x.se ? 1 : 2;
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  rep (i, 1, n) {
    cin >> sz;
    rep (j, 1, sz) cin >> c[j];
    a[i].fi = *min_element(c + 1, c + sz + 1);
    a[i].se = *max_element(c + 1, c + sz + 1);
  }
  sort(a + 1, a + n + 1);
  mn[n + 1] = 1e9;
  per (i, n, 1) mn[i] = min(mn[i + 1], a[i].se);
  int pos = 1, ans = 0;
  rep (i, 1, n) {
    while (pos <= n && a[pos].fi <= a[i].fi) pos++;
    vis[i] = (mn[pos] < a[i].se), ans += 2 * vis[i];
  }
  rep (i, 1, n) if (!vis[i]) b[++m] = a[i];
  // rep (i, 1, m) cerr << b[i].fi << " " << b[i].se << '\n';
  for (int l = 1, r; l <= m; l = r + 1) {
    r = l;
    while (r < m && b[r + 1].fi < b[l].se) r++;
    if (l == r) {
      ans += g(b[l]);
    } else {
      int x = l, y = r;
      rep (i, l, r) if (b[i].fi == b[l].fi && b[i].se < b[x].se) x = i;
      rep (i, l, r) if (b[i].se == b[r].se && b[i].fi > b[y].fi) y = i;
      rep (i, l, r) if (i != x && i != y) ans += g(b[i]);
      if (check(x, y)) ans += g(b[x]) + g(b[y]) - min(1, g(b[x]) - 1 + g(b[y]) - 1);
      else ans += g(b[x]) + g(b[y]) - min(1, g(b[x]) - 1) - min(1, g(b[y]) - 1);
    }
  }
  cout << ans << '\n';
}