#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define int long long
#define F first
#define S second
#define pb push_back
int n,a[1000005],ans[1000005];
vector<int> v[1000005];
signed main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin>>n;
    int sum=0;
    for(int i=0;i<=1000000;i++) ans[i]=1e18;
    for(int i=1;i<=1000000;i++)
    {
        for(int j=1;j<=1000000/i;j++) v[i*j].pb(i);
    }
    multiset<int> s;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        sum+=a[i];
        ans[a[i]]=0;
    }
    //cout<<a[n-1]<<endl;
    for(int i=1;i<=a[n-1];i++)
    {
        //cout<<i<<endl;
        for(int j=0;j<v[i].size();j++)
        {
            //cout<<v[i-1][j]<<endl;
            if(ans[v[i][j]]<1e17&&v[i][j]!=i)
            {
                s.erase(s.find(ans[v[i][j]]));
                ans[v[i][j]]+=v[i][j];
                s.insert(ans[v[i][j]]);
            }
        }
        //cout<<"rkv"<<endl;
        if(ans[i]==0)
        {
            if(i!=a[0]) ans[i]=(*s.begin());
            ans[i]+=i;
            s.insert(ans[i]);
            //cout<<ans[i]<<endl;
        }
    }
    cout<<sum-ans[a[n-1]]+a[n-1]<<'\n';








}