Fox Ciel is playing a card game with her friend Fox Jiro. There are $*n*$ piles of cards on the table. And there is a positive integer on each card.

The players take turns and Ciel takes the first turn. In Ciel's turn she takes a card from the top of any non-empty pile, and in Jiro's turn he takes a card from the bottom of any non-empty pile. Each player wants to maximize the total sum of the cards he took. The game ends when all piles become empty.

Suppose Ciel and Jiro play optimally, what is the score of the game?

Input

The first line contain an integer $*n*$ ($1 ≤ *n* ≤ 100$). Each of the next $*n*$ lines contains a description of the pile: the first integer in the line is $*s*_{*i*}$ ($1 ≤ *s*_{*i*} ≤ 100$) — the number of cards in the $*i*$-th pile; then follow $*s*_{*i*}$ positive integers $*c*_{1}$, $*c*_{2}$, ..., $*c*_{*k*}$, ..., $*c*_{*s*_{*i*}}$ ($1 ≤ *c*_{*k*} ≤ 1000$) — the sequence of the numbers on the cards listed from top of the current pile to bottom of the pile.

Output

Print two integers: the sum of Ciel's cards and the sum of Jiro's cards if they play optimally.

Note

In the first example, Ciel will take the cards with number 100 and 1, Jiro will take the card with number 10.

In the second example, Ciel will take cards with numbers 2, 8, 6, 5, 9 and Jiro will take cards with numbers 4, 7, 1, 3.