#include <bits/stdc++.h>
using namespace std;
int n,ok[5005],sws[52]; bitset<5005> bs[53][53];
int main() {
	cin.tie(0)->sync_with_stdio(false); int ans = 0;
	cin >> n; for(int i = 1; i <= n; i++) { long long msk = 0;
		int m; cin >> m; bitset<5005> b; b.reset();
		for(int j = 1; j <= m; j++) {cin >> sws[j]; msk |= (1ll<<sws[j]);} sort(sws+1,sws+1+m);
		for(int j = 1; j <= m; j++) b ^= bs[sws[j-1]+1][sws[j]]; 
		ans += b.count();
		for(int l = 1; l <= 51; l++) {
			for(int r = l; r <= 51; r++) {
				int sws = (1ll<<(r))-(1ll<<(l-1));
				if(msk&sws) bs[l][r][i] = 1;
			}
		}
	}
	cout << ans;
	return 0;
}