#include <bits/stdc++.h>
const long long int mod = 9999999999999983;
long long int primes[6] = {1125899906842597, 1495921043, 1005985879,
                           1495921043,       1005985879, 1495921043};
using namespace std;
vector<long long int> adj[2000009];
long long int parent[2000009];
long long int vis[2000009];
long long int level[2000009];
long long int dist[2000009];
long long int dp[100009];
long long int arr[100009];
long long int brr[2000009];
long long int crr[2000009];
long long int hashing[2000009];
long long int ar[509][509];
long long int br[509][509];
long long int cr[509][509];
long long int multiply(long long int a, long long int b) {
  return ((a % mod) * (b % mod)) % mod;
}
long long int add(long long int a, long long int b) {
  return ((a % mod) + (b % mod)) % mod;
}
long long int sub(long long int a, long long int b) {
  return ((a % mod) - (b % mod) + mod) % mod;
}
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = ((res % p) * (x % p)) % p;
    y = y >> 1;
    x = ((x % p) * (x % p)) % p;
  }
  return res;
}
int main() {
  int start_s = clock();
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  vector<long long int> vect, vt, vct;
  vector<long long int>::iterator itt;
  set<long long int> st;
  set<long long int>::iterator itr;
  map<long long int, long long int> mp, mpp, mp1, mp2;
  map<long long int, long long int>::iterator it;
  long long int i, j, k, n, m, res1, res2, q, t, a, b, c,
      maxi = INT_MIN, mini = INT_MAX, sum = 0, ans = 0, res = 0, val = 0,
      ans1 = 0, ans2 = 0, rem = 0, diff = 0, cnt = 0, l, r, flag = 0, e, index,
      val1 = 0, val2 = 0, z, h = 0, u, v, mid, len, tot, fl = 0;
  string str, str1, str2;
  cin >> n;
  long long int arr[n + 1][3000];
  long long int sz[n + 1];
  for (i = 1; i <= n; i++) {
    cin >> sz[i];
    for (j = 1; j <= sz[i]; j++) {
      cin >> e;
      arr[i][j] = e;
    }
  }
  ans = 0, res = 0;
  for (i = 1; i <= n; i++) {
    for (j = 1, k = sz[i]; j <= sz[i] / 2; j++, k--) {
      ans += arr[i][j];
      res += arr[i][k];
    }
    if (sz[i] % 2 == 1) {
      vect.push_back(arr[i][(sz[i] + 1) / 2]);
    }
  }
  sort(vect.rbegin(), vect.rend());
  for (i = 0; i < vect.size(); i++) {
    if (i % 2 == 0)
      ans += vect[i];
    else
      res += vect[i];
  }
  cout << ans << " " << res;
}
