//Breaking Sticks
//https://www.hackerrank.com/contests/world-codesprint-12/challenges/red-knights-shortest-path/submissions/code/1304460896
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
ll n,num,ans;
int main()
{
    ios_base::sync_with_stdio(0);
    cin>>n;
    while(n--)
    {
        cin>>num;
        vector<ll> v;
        for(ll i=1;i<sqrt(num);i+=1LL)
        {
            if(num%i==0)
                v.push_back(i);
        }
        int index=v.size()-1;
        ll root=(ll)sqrt(num);
        if((num%root)==0 && root*root==num)
              v.push_back(root);
        for(int i=index;i>=0;i--)
        {
            v.push_back(num/v[i]);
        }
        ans+=num;
        ll cur=1;
        for(int i=1;i<v.size();i++)
        {
            if(v[i]%cur==0)
            {
                cur=v[i];
                ans+=(num/cur);
            }
        }
    }
    cout<<ans;
    return 0;
}