|Educational Codeforces Round 18|
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:
Print the minimum possible number of sets.
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).
Print one integer number — the minimum possible number of sets.
4 7 8
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.