#include<bits/stdc++.h>
using namespace std;
int n, a[3005][7], f[2][3005];
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	memset(f, 0x3f, sizeof f);
	f[0][0] = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i][0];
		for (int j = 1; j <= a[i][0]; j++) {
			cin >> a[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		memset(f[i & 1], 0x3f, sizeof(f[i & 1]));
		for (int j = 1; j <= a[i][0]; j++) {
			for (int k = 0; k <= n; k++) {
				f[i & 1][k] = min(f[i & 1][k], f[!(i & 1)][k] + a[i][j]);
			}
			for (int k = 0; k < n; k++) {
				if (!(i - 1) || f[!(i & 1)][k] < a[i][j] * (i - 1)) {
					f[i & 1][k + 1] = min(f[i & 1][k + 1], f[!(i & 1)][k] + a[i][j]);
				}
			}
		}
	}
	for (int i = n; i >= 0; i--) {
		if (f[n & 1][i] != 0x3f3f3f3f) {
			cout << i;
			return 0;
		}
	}
}