#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define x first
#define y second
#define bg begin()
#define ed end()
#define pb push_back
#define mp make_pair
#define sz(a) int((a).size())
#define R(i,n) for(int i(0);i<(n);++i)
#define L(i,n) for(int i((n)-1);~i;--i)
const int iinf=0x3f3f3f3f;
const ll linf=0x3f3f3f3f3f3f3f3f;
//Data
const int N=100;
int n;
vector<int> mid;
//Main
int main(){
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
cin>>n;
int na=0,nb=0;
R(i,n){
int m; cin>>m;
R(i,m){
int x; cin>>x;
if(i+1<=m/2) na+=x;
else if(m-i<=m/2) nb+=x;
else mid.pb(x);
}
}
sort(mid.bg,mid.ed,greater<int>());
R(i,sz(mid)){
if(i&1) nb+=mid[i];
else na+=mid[i];
}
cout<<na<<" "<<nb<<'\n';
return 0;
}