Fox and Card Game

Fox Ciel is playing a card game with her friend Jiro. There are $n$ piles of cards on the desk, and every card has one positive integer written on it.

The two players take one card each in alternating turns, and Ciel takes first. On her turn Ciel picks a non-empty pile and takes the top card of that pile. On his turn Jiro picks a non-empty pile and takes the bottom card of that pile. The game ends when no card is left on the desk.

When the game ends, each player's score is the sum of the numbers on the cards that player took. A player who took no card scores 0. Both players want to make their own score as large as possible. Find the score of Ciel and the score of Jiro when both play optimally.

The first line contains the number of piles $n$ ($1 \le n \le 100$).

Each of the next $n$ lines contains $s_i$ followed by $s_i$ integers $c_{i1}, c_{i2}, \dots, c_{is_i}$ ($1 \le s_i \le 100$, $1 \le c_{ij} \le 1000$). Pile $i$ holds $s_i$ cards stacked from top to bottom in the order given, so $c_{i1}$ is the top card and $c_{is_i}$ is the bottom card.

Print the score of Ciel and the score of Jiro on one line, separated by a single space.