[{"sectionTitle":"题目描述","type":"Text","text":"原题来自：CERC 1995\r\n\r\n乔治有一些同样长的小木棍，他把这些木棍随意砍成几段，直到每段的长都不超过 $50$ 。现在，他想把小木棍拼接成原来的样子，但是却忘记了自己开始时有多少根木棍和它们的长度。给出每段小木棍的长度，编程帮他找出原始木棍的最小可能长度。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"第一行为一个单独的整数 $N$ 表示砍过以后的小木棍的总数。\r\n第二行为 $N$ 个用空格隔开的正整数，表示 $N$ 根小木棍的长度。\r\n","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"输出仅一行，表示要求的原始木棍的最小可能长度。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["9\n5 2 1 5 2 1 5 2 1","6"]},{"sectionTitle":"数据范围与提示","type":"Text","text":" $1 \\leq N \\leq 60$","subType":"markdown"}]