#include <bits/stdc++.h>
#define ll long long
using namespace std;

struct Seg{

	int sz;
	vector<int> tr;

	int def = 0;

	Seg(int n){

		sz = 1;

		while(sz < n){

			sz*=2;
		}

		tr.resize(2*sz, def);
	}

	void change(int ind, int val){

		ind+=sz;

		tr[ind]+= val;

		for(int i = ind/2; i>0; i/=2){

			tr[i] = tr[2*i] + tr[2*i+1];
		}
	}

	int run(int l, int r, int st, int en, int v = 1){

		if(l <= st && r >= en){

			return tr[v];
		}

		if(l >= en || r <= st){

			return def;
		}

		int m = (st+en)/2;

		return run(l,r,st,m,2*v) + run(l,r,m,en,2*v+1);
	}

	int range(int l, int r){

		return run(l,r,0,sz);
	}
};

int main(){

	int n;
	cin >> n;
	vector<vector<int>> a(n);

	for(auto&v : a){

		int m;
		cin >> m;
		v.resize(m);

		for(auto&i : v){

			cin >> i;
		}
	}

	Seg seg(n);

	long long res = 0;
	for(int i = 0; i<n; ++i){

		int m = a[i].size();

		for(int j = 0; j<m; ++j){

			int cur = seg.range(a[i][j]+1, n);

			res += cur;

		}
		for(int j = 0; j<m; ++j){

			seg.change(a[i][j], 1);
		}

	}

	cout << res << endl;
}