#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i=a; i<b; i++)
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define fo(i, n) rep(i, 0, n)
#define F first
#define S second
#define MP make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;

const int NMAX = 1123456;

int in[NMAX];
int it[NMAX];
int n;

int main() {
	scanf("%d", &n);
	ll out=0;

	int is=1;
	while(is<=n) is*=2;
	fo(i,n)
	{
		int m;
		scanf("%d", &m);
		fo(i,m) scanf("%d", in+i);


		fo(i,m)
		{
			int x = in[i]+is;
			for(;x;x=x/2)
			{
				if(x%2 == 0) out+=it[x+1];
			}
		}
		fo(i,m)
		{
			int x = in[i]+is;
			it[x]++;
			for(x=x/2;x;x=x/2) it[x]=it[2*x]+it[2*x+1];
		}
		
	}
	printf("%lld\n", out);

}