CF792E.Colored Balls

There are n boxes with colored balls on the table. Colors are numbered from 1 to n. i-th box contains a__i balls, all of which have color i. You have to write a program that will divide all balls into sets such that:

• each ball belongs to exactly one of the sets,
• there are no empty sets,
• there is no set containing two (or more) balls of different colors (each set contains only balls of one color),
• there are no two sets such that the difference between their sizes is greater than 1.

Print the minimum possible number of sets.

桌上有 $n$ 个装有彩色小球的盒子。颜色编号为 $1$ 到 $n$。第 $i$ 个盒子中有 $a_i$ 个小球，且所有小球的颜色均为 $i$。你需要编写一个程序，将所有小球划分为若干集合，满足以下条件：

• 每个小球恰好属于一个集合；
• 不存在空集合；
• 不存在包含两种（或更多）不同颜色小球的集合（即每个集合仅包含同一种颜色的小球）；
• 不存在两个集合，其大小之差大于 $1$。

请输出满足上述条件的集合的最小可能数量。

The first line contains one integer number n (1 ≤ n ≤ 500).

The second line contains n integer numbers _a_1, _a_2, ... , a__n (1 ≤ a__i ≤ 109).

第一行包含一个整数 $ n $（$ 1 \leq n \leq 500 $）。

第二行包含 $ n $ 个整数 $ a_1, a_2, \dots, a_n $（$ 1 \leq a_i \leq 10^9 $）。

Print one integer number — the minimum possible number of sets.

输出一个整数——集合的最少可能数量。

In the first example the balls can be divided into sets like that: one set with 4 balls of the first color, two sets with 3 and 4 balls, respectively, of the second color, and two sets with 4 balls of the third color.

在第一个例子中，这些球可以被划分为如下集合：一个包含 4 个第一种颜色球的集合，两个分别包含 3 个和 4 个第二种颜色球的集合，以及两个各包含 4 个第三种颜色球的集合。