#include <bits/stdc++.h>

using namespace std;

set<long> factors;
vector<long> prime;
vector<long> fact;
void find_factors(long x)
{
    while(x%2==0)
    {
        prime.push_back(2);
        x=x/2;
    }
    for(int i=3;i<=sqrt(x);i+=2)
    {
        while(x%i==0)
        {
            prime.push_back(i);
            x=x/i;
        }
    }
    if(x>2)
        prime.push_back(x);
    int l1=prime.size();
    for(int i=0;i<l1;i++)
    {
        long f=1;
        for(int j=i;j<l1;j++)
        {
            f=f*prime[j];
            factors.insert(f);
        } 
    }
    factors.insert(1);
    set<long>::iterator itr;
    for(itr=factors.begin();itr!=factors.end();itr++)
    {
        fact.push_back(*itr);
    }
    
}

int max(int a,int b)
{
    return (a>b)?a:b;
}

long break_stick(long x)
{

    find_factors(x);
    long s=fact.size();
    sort(fact.begin(),fact.end(),greater<int>());
    long dp[s];
    for(int i=0;i<s;i++)
        dp[i]=1;
    for(long i=1;i<s;i++)
    {
        for(long j=0;j<i;j++)
        {
            if(fact[j]%fact[i]==0)
            {
                dp[i]=max(dp[i],(x/fact[i])+dp[j]);
            }
        }
    }
    
    prime.clear();
    fact.clear();
    factors.clear();
    return dp[s-1];
    
}

long longestSequence(vector <long> a) {
    int l=a.size();
    long sum=0;
    for(int i=0;i<l;i++)
    {
        sum=sum+break_stick(a[i]);
    }
    return sum;
    //  Return the length of the longest possible sequence of moves.
}

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 = longestSequence(a);
    cout << result << endl;
    return 0;
}