#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<std::deque<ll>> bags(N);
  for (int i = 0; i < N; i++) {
    int K;
    std::cin >> K;

    ans += K;

    std::vector<ll> ttt;

    for (int k = 0; k < K; k++) {
      ll tmp;
      std::cin >> tmp;
      ttt.push_back(tmp);
    }

    std::ranges::sort(ttt);

    for (ll x : ttt) {
      bags[i].push_back(x);
    }
  }

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

  auto ooooo = [&](bool rev = false) {
    std::vector<event> events;

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

    std::ranges::sort(events);

    // if (rev) {
    //   std::ranges::reverse(events);
    // }

    std::vector<ll> pops;

    for (auto [x, f, i] : events) {
      // x = std::abs(x);

      if (f == 1) {
        auto it = std::ranges::lower_bound(pops, bags[i].front());

        // std::cerr << "bag " << i << ": ";

        if (it == pops.end()) {
          bags[i].clear();
          bags[i].push_back(x);

          // std::cerr << "pop all" << std::endl;
        } else {
          while (bags[i].size() > 1 && bags[i][1] < *it) {
            bags[i].pop_front();

            // std::cerr << "pop ";
          }
          // std::cerr << std::endl;
        }

        pops.push_back(x);
      }
    }
  };

  ooooo();

  for (auto& bag : bags) {
    std::vector<ll> tmp(bag.begin(), bag.end());

    std::ranges::reverse(tmp);

    bag.clear();

    for (ll x : tmp) {
      bag.push_back(-x);
    }
  }

  ooooo(true);

  ans = 0;

  for (int i = 0; i < N; i++) {
    ans += std::min(bags[i].size(), 2UL);
  }

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

  // for (int i = 0; i < N; i++) {
  //   for (ll x : bags[i]) {
  //     std::cerr << x << " ";
  //   }
  //
  //   std::cerr << "\n";
  // }
}