Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Line to Cashier

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLittle Vasya went to the supermarket to get some groceries. He walked about the supermarket for a long time and got a basket full of products. Now he needs to choose the cashier to pay for the products.

There are *n* cashiers at the exit from the supermarket. At the moment the queue for the *i*-th cashier already has *k*_{i} people. The *j*-th person standing in the queue to the *i*-th cashier has *m*_{i, j} items in the basket. Vasya knows that:

- the cashier needs 5 seconds to scan one item;
- after the cashier scans each item of some customer, he needs 15 seconds to take the customer's money and give him the change.

Of course, Vasya wants to select a queue so that he can leave the supermarket as soon as possible. Help him write a program that displays the minimum number of seconds after which Vasya can get to one of the cashiers.

Input

The first line contains integer *n* (1 ≤ *n* ≤ 100) — the number of cashes in the shop. The second line contains *n* space-separated integers: *k*_{1}, *k*_{2}, ..., *k*_{n} (1 ≤ *k*_{i} ≤ 100), where *k*_{i} is the number of people in the queue to the *i*-th cashier.

The *i*-th of the next *n* lines contains *k*_{i} space-separated integers: *m*_{i, 1}, *m*_{i, 2}, ..., *m*_{i, ki} (1 ≤ *m*_{i, j} ≤ 100) — the number of products the *j*-th person in the queue for the *i*-th cash has.

Output

Print a single integer — the minimum number of seconds Vasya needs to get to the cashier.

Examples

Input

1

1

1

Output

20

Input

4

1 4 3 2

100

1 2 2 3

1 9 1

7 8

Output

100

Note

In the second test sample, if Vasya goes to the first queue, he gets to the cashier in 100·5 + 15 = 515 seconds. But if he chooses the second queue, he will need 1·5 + 2·5 + 2·5 + 3·5 + 4·15 = 100 seconds. He will need 1·5 + 9·5 + 1·5 + 3·15 = 100 seconds for the third one and 7·5 + 8·5 + 2·15 = 105 seconds for the fourth one. Thus, Vasya gets to the cashier quicker if he chooses the second or the third queue.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/18/2017 07:25:58 (c6).

Desktop version, switch to mobile version.

User lists

Name |
---|