#include<bits/stdc++.h>
using namespace std;
int  n, ans1, ans2, idx;
int maxx[110];
bool cmp(int a, int b){
	return a > b;
}
int main(){
	cin >> n;
	for (int i = 1; i <= n; i++){
		int m, x;
		cin >> m;
		bool flag = m % 2;
		for (int j = 1; j <= m; j++){
			cin >> x;
			if (j <= m / 2 && m != 1)
				ans1 += x;
			else if (j > m / 2 + 1 && flag)
				ans2 += x;
			else if (j > m / 2 && !flag)
				ans2 += x; 
			if(flag)
				if (j == m / 2 + 1)
					maxx[idx++] = x;
		} 
	}
	sort(maxx, maxx + idx, cmp);
	for (int i = 0; i < idx; i++){
		if(!i % 2)
			ans1 += maxx[i];
		else
			ans2 += maxx[i];
	}
	cout << ans1 << " " << ans2 << endl;
	return 0;		
}