/*Template by hemnath_d(Enlightened by chamow)*/
#include<bits/stdc++.h>
using namespace std;
/*--------------------------------------------------------------*/
typedef long long ll;
typedef long double ld;
typedef vector<ll> vec;
typedef vector<int> vi;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
/*--------------------------------------------------------------*/
#define fastread ios_base::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define fx first
#define sx second
#define forw(i,a,n) for(i=a;i<=n;i++)
#define rev(i,a,n) for(i=a;i>=n;i--)
#define For(i,a,n) for(i=a;i<n;i++)
#define Rev(i,a,n) for(i=a;i>n;i--)
#define inf 100000000000000
#define minf -100000000000000
/*--------------------------------------------------------------*/
//Function to add an edge for graph
//Undirected graph
void add_edge(vec adj[],ll a,ll b)
{
    adj[a].pb(b);
    adj[b].pb(a);
}
/*---------------------------------------------------------------*/
//Comparator class for min-heap using priority_queue
//Change the parameters before use
class myComparator
{
public:
    int operator() (/*Datatype*/int p1,/*Datatype*/int  p2)
    {
        return p1/*value*/ > p2/*value*/;
    }
};
/*----------------------------------------------------------------*/
//END OF TEMPLATE
/*----------------------------------------------------------------*/
int main()
{
    fastread;
    ll n;
    cin>>n;
    ll sum=0;
    while(n--)
    {
        ll val;
        cin>>val;
        vec arr,brr;
        ll t=sqrt(val);
        ll i,x;
        forw(i,1,t)
        {
            if(val%i==0)
            {
                arr.pb(i);
                x=val/i;
                brr.pb(x);
                //cout<<i<<" "<<x<<endl;
            }
        }
        if(arr[arr.size()-1]==brr[brr.size()-1])
            brr.pop_back();
        sum+=brr[0];
        ll last=brr[0];
        For(i,1,brr.size())
        {
            if(last%brr[i]==0)
            {
                sum+=brr[i];
                last=brr[i];
            }
        }
        for(ll i=arr.size()-1;i>=0;i--)
        {
            if(last%arr[i]==0)
            {
                sum+=arr[i];
                last=arr[i];
            }
        }
        if(val==1)
            sum--;
        //cout<<"sum "<<sum<<endl;
    }
    cout<<sum<<endl;
    return 0;
}