#include <bits/stdc++.h>
using namespace std;
long long k, ans, a[501], i, g, n;
long long check(long long x) {
  k = 0;
  if (x == 1) return 0;
  for (long long i = 1; i <= n; i++)
    if (a[i] / (x - 1) * x < a[i])
      return 0;
    else
      k += (a[i] + x - 1) / x;
  if (k < ans) ans = k;
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]), ans += a[i] / 2 + a[i] % 2;
  sort(a + 1, a + n + 1);
  for (i = 2; i <= sqrt(a[n]) + 2; i++) check(i);
  for (i = 1; i <= sqrt(a[n]); i++) {
    g = a[n] / i, check(g), check(g + 1), check(g + 2);
  }
  printf("%lld\n", ans);
}
