#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];
ll DP(ll x){
	// cout<<"solving "<<x<<endl;
	if(x == 1) return 0;
	if(~dp[x]) return dp[x];
	dp[x] = 1e18;

	ll pt = x-1;
	while(pt >= 1){
		ll val = a[x] / a[pt];
		ll l=1, r=pt, ans=pt;
		while(l<=r){
			ll mid=(l+r)>>1;
			assert(a[mid]);
			if(a[x]/a[mid] == val){
				ans=mid;
				r=mid-1;
			}else l=mid+1;
		}
		dp[x] = min(dp[x], DP(ans) + val);
		// cout<<"trans "<<x<<" to "<<ans<<endl;
		pt = ans - 1;
	}
	return dp[x];
}
void procedure(){
	memset(dp, -1, sizeof(dp));
	n=read();
	for(ll i=1;i<=n;i++) a[i]=read();
	sort(a+1, a+n+1);
	printf("%lld\n", DP(n));
}
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;
}