Vasya去超市买东西，挑选完要买的东西后来到了结账处。

超市的出口处有n<span>个收银员，结账的人已经在这里排起了长队。第</span><span>i</span><span>条队伍中共有</span><span>ki</span><span>个人，其中第</span><span>i</span><span>列的第</span><span>j</span><span>个人的购物筐里有</span><span>mij</span><span>样东西。现已知：</span> 

收银员每<span>5</span><span>秒扫描一样东西；</span> 

每位顾客算完帐后需要<span>15</span><span>秒时间收钱找钱；</span> 

当然，<span>Vasya</span><span>想选一列时间最短的队伍排队。帮他写一个程序算出可能的最短秒数。</span> 

（单击提示有说明）

<br />

<br />

第一行是一个整数<span>n</span>(1<span> ≤ </span>n ≤ <span>100</span>)，代表超市收银员的数量；第二行有<span>n</span><span>个空格分隔的整数</span><span>k1</span><span>、</span><span>k2</span><span>、……</span><span>kn</span>&nbsp;(1<span> ≤ </span>ki ≤ <span>100</span>)，<span>ki</span><span>表示第</span><span>i</span><span>个收银员前的队列人数；接下来有</span><span>n</span><span>行，第</span><span>i</span><span>行有</span><span>ki</span><span>个数，</span>mi,<span> </span><span>1</span>,<span> </span>mi,<span> </span><span>2</span>,<span> </span><span>...,</span><span> </span>mi,<span> </span>ki&nbsp;(1<span> ≤ </span>mi,<span> </span>j ≤ <span>100</span>)表示队伍中第<span>j</span><span>个人有</span>mi,<span> </span>j项物品。

<br />

<span></span><span></span><span></span><span></span><span></span><span></span><span></span><span></span><span></span><span></span><span></span><span></span><span></span><span></span> 

       独占一行的一个整数，代表用时最短的队伍秒数。