#include <bits/stdc++.h>
//#define int long long
#define fi first
#define se second 
#define pb push_back
#define ott(i, l, r) for (int i = (l); i <= (r); i ++)
#define tto(i, l, r) for (int i = (r); i >= (l); i --)
using namespace std;
int read () {
	int x = 0; bool f = false; char c = getchar ();
	while (!isdigit (c)) f |= (c == '-'), c = getchar ();
	while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
	return f ? -x : x;
}
typedef long long ll;
const int N = 10001, mod = 1e9 + 7;
int T, n, res1, res2;
int a[N][N], t[N];
pair <int, int> pos[N];
int main () {
	n = read ();
	ott (i, 1, n) {
		a[i][0] = read (); 
		ott (j, 1, a[i][0]) t[++ t[0]] = a[i][j] = read ();
	}
	sort (t + 1, t + 1 + t[0]);
	ott (i, 1, n)
	    ott (j, 1, a[i][0])
	        pos[a[i][j] = lower_bound (t + 1, t + 1 + t[0], a[i][j]) - t] = {i, j};
	ott (i, 1, t[0]) {
		int x = pos[i].fi, y = pos[i].se;
		while (a[x][y + 1] == a[x][y] + 1) ++ y, ++ i;
		if (a[x][y + 1]) ++ res1; ++ res2;
	}
	-- res2, printf ("%d %d\n", res1, res2);
	return 0;
}