#include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <list>

using namespace std;

using u64 = unsigned long long;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    size_t n;
    cin >> n;

    vector<vector<int>> birds(n);

    u64 colisions = 0;

    for (int i = 0; i < n; ++i) {
        int count;
        cin >> count;
        birds[i].reserve(count);

        for (int j = 0; j < count; ++j) {
            int to;
            cin >> to;
            birds[i].push_back(to);

            for (int k = 0; k < i; ++k) {
                for (int toPrevious : birds[k]) {
                    if (to < toPrevious) {
                        ++colisions;
                    }
                }
            }
        }
    }

    cout << colisions << endl;
}