#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>

using namespace std;
using ll = long long;

void solve() {
    int n;
    ll mini = 1e18 + 5, maxi = 0;
    cin >> n;
    vector <ll> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        mini = min(mini, v[i]);
        maxi = max(maxi, v[i]);
    }
    sort(v.begin(), v.end());
    ll ans = maxi / mini, sum = 0;
    for (int i = 1; i < n; i++) {
        sum += v[i] / v[i - 1];
        if (i + 1 != n) {
            ans = min(ans, sum + v.back() / v[i]);
        }
    }
    ans = min(ans, sum);
    cout << ans << '\n';
}

signed main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int nrt = 1;
    //cin >> nrt;
    while (nrt--) {
        solve();
    }
    return 0;
}