1981. Sticks

单点时限: 5.0 sec

内存限制: 256 MB

George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally

输入格式

The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, there are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero.

输出格式

The output should contains the smallest possible length of original sticks, one per line.

样例

Input
9
5 2 1 5 2 1 5 2 1
4
1 2 3 4
0
Output
6
5

59 人解决,121 人已尝试。

148 份提交通过,共有 856 份提交。

5.3 EMB 奖励。

创建: 11 年,8 月前.

修改: 2 年,5 月前.

最后提交: 8 月,2 周前.

来源: Central Europe 1995

题目标签