#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> Pr;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
// #define mid ((l+r)>>1)
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }
ll n,a[200005],dp[200005];
void procedure(){
	memset(dp, 0x3f, sizeof(dp));
	n=read();
	for(ll i=1;i<=n;i++) a[i]=read();
	sort(a+1, a+n+1);
	dp[n]=0;
	for(ll i=n-1;i>=1;i--){
		ll pt = i+1;
		// cout<<"at "<<pt<<endl;
		while(pt <= n){
			ll v = a[pt]/a[i];
			ll t = a[i]*(v+1)-1;
			ll x = upper_bound(a+1, a+n+1, t) - (a+1);
			if(x <= pt) x = pt+1;
			dp[i] = min(dp[i], dp[x-1] + a[x-1]/a[i]);
			// cout<<"at "<<i<<" require for "<<x-1<<endl;
			pt = x;

			// cout<<"at "<<pt<<endl;
		}

		// cout<<"ok"<<endl;
	}
	printf("%lld\n", dp[1]);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}