#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;
vector<long long> v(10000000,-1);
long long helper(long long n)
{
    if(n<10000000)
    {
    if(v[n]!=-1)
        return v[n];
    }
    long long s=0,m=0;
    for(long long i=sqrt(n);i>1;i--)
    {
        //cout<<i<<endl;
        if((n%i)!=0)
            continue;
        //long long b=n/i;
        m++;
        long long s1=i*helper(n/i);
        long long s2=(n/i)*helper(i);
        long long b=max(s1,s2)+1;
        s=max(s,b);
    }
    if(m==0)
        s=n+1;
    if(n<10000000)
        v[n]=s;
    return s;
}
int main() {
    int n;
    cin >> n;
    long long sum=0;
    v[0]=1;
    v[1]=1;
    v[2]=3;
    v[3]=4;
    v[4]=7;
    v[5]=6;
    v[6]=10;
    v[7]=8;
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum+=helper(a[i]);
    }

    //memset(v,-1,sizeof(v));
    /*for(int i=0;i<n;i++)
    {
        //cout<<a[i]<<endl;

        sum+=helper(a[i]);
       // cout<<sum<<endl;
    }*/
    cout<<sum<<endl;
    /* Enter your code here. Print output to STDOUT */

    return 0;
}