2902. Contest

单点时限: 5.0 sec

内存限制: 256 MB

The second round of the annual student collegiate programming contest is being held in city N. To be prepared for the inrush of participants, the jury needs to know the number of them attending the previous, first round.
Unfortunately, the statistics regarding that first round (including the final standings) was lost during a recent disk failure and no backup was made.
The only hope is a short statistical summary that was found written on a tiny piece of paper by the oldest jury member. The percentage of teams which have solved the problem is provided for each problem of the the first round. Each percentage is an integer rounded using the usual mathematical rules (numbers with a fractional part strictly less than .5 are rounded down, the others are rounded up).
This is the only information the jury has at hand. Also, that oldest jury member clearly remembers that a prize was awarded to some team during the first round, probably for winning it. Hence, at least one team had participated in the first round.

输入格式

The first line of input contains an integer N (3 ≤ N ≤ 12) — the total number of problems in the contest. The second line of input contains N integers P1, . . . , PN. Each number Pi (0 ≤ Pi ≤ 100) denotes a percentage of the teams solved the ith problem.

输出格式

Print out the minimum possible number of teams that could have participated in the first round.

样例

Input
3
33 67 100
Output
3

32 人解决,52 人已尝试。

43 份提交通过,共有 170 份提交。

5.1 EMB 奖励。

创建: 8 年,8 月前.

修改: 2 年,4 月前.

最后提交: 3 月,1 周前.

来源: N/A

题目标签