#include <bits/extc++.h>

using ll = long long;
using pll = std::pair<ll, ll>;
using pii = std::pair<int, int>;

template <class T>
std::istream& operator>>(std::istream& is, std::vector<T>& xs) {
  for (T& x : xs) is >> x;
  return is;
}

template <class T>
bool chmax(T& x, const T& v) {
  if (x < v) {
    x = v;
    return true;
  } else {
    return false;
  }
}

template <class T>
bool chmin(T& x, const T& v) {
  if (x > v) {
    x = v;
    return true;
  } else {
    return false;
  }
}

int main() {
  int N;
  std::cin >> N;

  int ans = 0;
  std::vector<pll> bags(N);
  for (int i = 0; i < N; i++) {
    int K;
    std::cin >> K;

    ans += std::min(K, 2);

    pll p;
    std::cin >> p.first;
    p.second = p.first;

    for (int k = 1; k < K; k++) {
      ll tmp;
      std::cin >> tmp;
      chmin(p.first, tmp);
      chmax(p.second, tmp);
    }

    bags[i] = p;
  }

  using event = std::tuple<int, int, int>;

  auto oooo = [&](const std::vector<event>& events) {
    ll latest_pop = -1;
    for (auto&& [x, f, i] : events) {
      if (f == 0) {
        // pass
      } else {
        if (latest_pop < bags[i].first && bags[i].first != bags[i].second) {
          ans--;
          bags[i].first = bags[i].second;
        }
        latest_pop = x;
      }
    }
  };

  std::vector<event> events;

  for (int i = 0; i < N; i++) {
    auto&& [l, r] = bags[i];
    events.emplace_back(l, 0, i);
    events.emplace_back(r, 1, i);
  }

  std::ranges::sort(events);

  oooo(events);

  events.clear();

  for (int i = 0; i < N; i++) {
    auto&& [l, r] = bags[i];
    events.emplace_back(l, 0, i);
    events.emplace_back(r, 1, i);
  }

  std::ranges::sort(events);

  std::ranges::reverse(events);

  for (auto& [x, f, i] : events) {
    f = !f;
  }

  oooo(events);

  std::cout << ans << std::endl;
}