#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int N=200050;
const ll inf=9e18;
ll a[N];
mt19937 rng(time(0));
int main(){
    int n;
    scanf("%i",&n);
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
    }
    sort(a+1,a+1+n);
    ll ans=a[n]/a[1];
    ll now=0;
    for(int i=2;i<=n-1;i++){
        now+=a[i]/a[i-1];
        ans=min(ans,now+a[n]/a[i]);
    }
    printf("%lld\n",ans);

    /*int t;
    scanf("%i",&t);
    while(t--){
        int n=rng()%10+1;
        for(int i=1;i<=n;i++){
            //scanf("%lld",&a[i]);
            a[i]=rng()%10000+1;
        }
        sort(a+1,a+1+n);
        ll ans=inf;
        vector<vector<ll>> best;
        do{
            ll now=0;
            for(int i=2;i<=n;i++){
                now+=a[i]/a[i-1];
            }
            now+=a[1]/a[n];
            if(ans>now)best.clear();
            ans=min(ans,now);
            if(ans==now){
                vector<ll> arr;
                for(int i=1;i<=n;i++)arr.pb(a[i]);
                best.pb(arr);
            }
        }while(next_permutation(a+2,a+1+n));
        printf("%lld\n",ans);
        for(auto v:best){
            for(ll x:v)printf("%lld ",x);
            printf("\n");
        }
    }*/
    return 0;
}