#include <bits/stdc++.h>
//#include <boost/math/common_factor.hpp>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pi pair<int,int>
#define pll pair<long long,long long>
#define mapi map<int,int>
#define mapll map<long long,long long>
#define vi vector<int>
#define vii vector<vector<int> >
#define vll vector<long long>
#define vpi vector<pair<int,int> >
#define vs vector<string>
#define vpll vector<pair <long long,long long> >
#define lcm(a,b) boost::math::lcm(a,b)
#define stacki stack<int>
#define stackll stack<long long>
#define queuei queue<int >
#define queuell queue<long long >
#define pr_qi priority_queue<int >
#define pr_qll priority_queue<long long >
#define m_p(a,b) make_pair(a,b)
#define p_b(a) push_back(a)
#define endl "\n"
#define big 1000000007
//

ll fun(ll num)
{
    vector<ll >a;
    int i,j;
    for(i=1;i<=sqrt(num);i++)
    {
        if(num%i==0)
        {
            if(i==num/i)
                a.p_b(i);
            else
                a.p_b(i),a.p_b(num/i);
        }
    }
    sort(a.begin(),a.end());
   // for(i=0;i<a.size();i++)
   //     cout<<a[i]<<" ";
   // cout<<endl;
    
    ll b[a.size()];
    for(i=0;i<a.size();i++)
    {
        if(i==0)
            b[i]=0;
        else
            b[i]=1;
    }
    for(i=0;i<a.size();i++)
    {
        for(j=i+1;j<a.size();j++)
        {
            if(a[j]%a[i]==0)
                b[j]=max(b[j],a[j]/a[i]*b[i]+1);
        }
    } 
    return b[a.size()-1];
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	//
	
    int n,i;
    cin>>n;
    ll a[n],sum=0;
    for(i=0;i<n;i++)
    {
        cin>>a[i];
        sum+=fun(a[i])+a[i];
    }
	cout<<sum;
	//
	return 0;
}