Happiness

Pang graduated from college $3$ years ago and really misses the time he spent with ICPC (Interspecies Collegiate Pokemon Camp).

A contest in ICPC has $10$ problems. $n$ participating teams have $300$ minutes to solve them. After the contest, teams are ranked by the number of problems solved. Teams that solve the same number of problems are ranked by least total time. The total time is the sum of the time consumed for each problem solved. The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submission of the first accepted run plus $20$ penalty minutes for every previously rejected run for that problem. No time is consumed for a problem that is not solved. If two teams tie, their solution time lists are computed. A team's solution time list is the list of the solution times of all problems solved by that team, sorted in descending order. The solution time of a problem is the time elapsed from the beginning of the contest to the submission of the first accepted run of that problem. (No penalty is added to the solution time.) The team with the lexicographically smaller solution time list has the better rank. A list $(a_1, \ldots, a_k)$ is lexicographically smaller than $(b_1,\ldots,b_k)$ if there is an integer $i\in [1,k]$ such that $a_i<b_i$ and $a_j=b_j$ for every integer $j\in [1,i)$. If teams still tie, Pang's team is considered to have the better rank.

After the ranks are determined, prizes are awarded. Initially, a team with rank $r$ gets $\lfloor 5000/r\rfloor$ happiness. Then medals are awarded. Teams with rank $1$ to $\lfloor n/10\rfloor$ get a gold medal. The happiness of receiving a gold medal is $1200$. Teams with rank $\lfloor n/10\rfloor+1$ to $3\lfloor n/10\rfloor$ get a silver medal. The happiness of receiving a silver medal is $800$. Teams with rank $3\lfloor n/10\rfloor+1$ to $6\lfloor n/10\rfloor$ get a bronze medal. The happiness of receiving a bronze medal is $400$. Besides medals, for each problem, the team that solved it first gets $800$ happiness. The team that has at least one solution and the smallest solution time among all teams and all problems gets an extra $700$ happiness. The team that has at least one solution and the largest solution time among all teams and all problems gets an extra $500$ happiness. In case of a tie, Pang's team always gets the happiness.

There were $n$ teams in the contest Pang participated in. He remembers every submission (time and verdict) of every other team. For each problem, he also remembers whether he knew how to solve it, and the number of rejected runs and the time he needed to solve it.

If Pang solved the problems in the wisest order, what is the maximum happiness he could get? Pang cannot solve any problem after $300$ minutes from the beginning of the contest (he can solve a problem at exactly 300 minutes). Once Pang solves a problem, he must submit it immediately and solve another one. He cannot postpone his submission to get the last submission happiness.

The first line contains an integer $n$, the number of teams ($10\le n\le 300$, $n$ is a multiple of $10$).

Each of the next $n-1$ lines describes one team and contains the statuses of the $10$ problems. For each problem, if it is not solved by the team, the status is a single character "-". Otherwise, the status contains two integers $t$ and $w$ separated by a single space, the solution time and the number of rejected runs before the solution time ($1\le t\le 300, 0\le w\le 10$). Statuses of different problems are separated by ",".

The last line describes Pang's team. For each problem, if Pang did not know how to solve it, the status is a single character "-". Otherwise, the status contains two integers $x$ and $y$ separated by a single space, the time he needs and the number of rejected runs before he can solve it ($1\le x\le 300, 0\le y\le 10$). Statuses of different problems are separated by ",".

There are no extra spaces or other characters in the statuses of Pang and the other teams.

Output one integer: the maximum happiness.