#include <bits/stdc++.h>

using namespace std;
int prime(int x)
{
    if(x==1)
        return 0;
    for(int i=2;i<=sqrt(x);i++)
    {
        if(x%i==0)
            return 0;
    }
        return 1;
}
long longestSequence(long a) {
   if(prime(a))
       return (a+1);
   if(a>1)
   {
    long x=1,max=a+1;
        while(x<a)
        {
            if(a%x==0)
            {
                long an= (((a/x)*longestSequence(x))+1);
            if(an>max)
                max=an;
            }
            x++;
        }
       return max;
   }
    return 1;
}
int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result =0;
    for(int i=0;i<n;i++){
    long re = longestSequence(a[i]);
        //cout<<re<<endl;
        result=result +re;
    }
    cout << result << endl;
    return 0;
}