#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define lowbit(x) (x&-x)
#define inf 2000000000
#define log(x) (31^__builtin_clz(x))
using namespace std;
ll a[200005],dp[200005];
const ll qp18=1e18;
void solve(){
	int n;
	cin>>n;
	ll ans=0;
	set<ll>s;
	map<ll,int>mp;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		dp[i]=2e18;
	}
	dp[1]=0;
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		mp[a[i]]=i;
		s.insert(a[i]);
	}

	for(int i=1;i<n;i++){
		s.erase(a[i]);
		int tmp=a[i+1]/a[i];
		for(int j=tmp;j<=tmp+10;j++){
			if(a[i]*j>qp18)break;
			if(s.lower_bound(a[i]*j)!=s.end()){
				ll rs=*s.lower_bound(a[i]*j);
				if(rs>=a[i]*(j+1))continue;
				int loc=mp[rs];
				dp[loc]=min(dp[loc],dp[i]+j);
			}
		}
	}
	cout<<dp[n]<<"\n";
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0);
    int t=1;
	//cin>>t;
    while(t--)solve();
    return 0;
}