#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
template <class T>
void dbs(string str, T t) {
  cout << str << " : " << t << endl;
}
template <class T, class... second>
void dbs(string str, T t, second... s) {
  int idx = str.find(',');
  cout << str.substr(0, idx) << " : " << t << ",";
  dbs(str.substr(idx + 1), s...);
}
template <class second, class T>
ostream& operator<<(ostream& os, const pair<second, T>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class second, class T>
ostream& operator<<(ostream& os, const map<second, T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
void prc(T a, T b) {
  cout << "[";
  for (T i = a; i != b; ++i) {
    if (i != a) cout << ", ";
    cout << *i;
  }
  cout << "]";
  cout << endl;
}
int get(int x, int a) {
  if (x < 0 or x > a) return inf;
  if (x == 0) return a;
  if (x == a) return 1;
  if (x * ((a + x) / (x + 1)) <= a) return (a + x) / (x + 1);
  return inf;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = (0); i <= (n - 1); ++i) cin >> a[i];
  long long yo = 1e18;
  for (int i = (1); i <= (40000); ++i) {
    long long ans = 0;
    for (int j = (0); j <= (n - 1); ++j) {
      int x = get(i, a[j]);
      if (x == inf) break;
      ans += x;
      if (j == n - 1) {
        yo = min(yo, ans);
      }
    }
  }
  for (int i = (1); i <= (40000); ++i) {
    long long ans = 0;
    for (int j = (0); j <= (n - 1); ++j) {
      int x = get(a[0] / i, a[j]);
      if (x == inf) break;
      ans += x;
      if (j == n - 1) {
        yo = min(yo, ans);
      }
    }
  }
  for (int i = (1); i <= (40000); ++i) {
    long long ans = 0;
    for (int j = (0); j <= (n - 1); ++j) {
      int x = get(a[0] / i - 1, a[j]);
      if (x == inf) break;
      ans += x;
      if (j == n - 1) {
        yo = min(yo, ans);
      }
    }
  }
  cout << yo << "\n";
  return 0;
}
