#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<map>

using namespace std;


void getDivisors(long long int n,vector<long long int>& divisors) {
    for (long long int i=2; i<=sqrt(n); i++)
    {
        if (n%i==0 && i!=n)
        {
            if (n/i == i) {
                divisors.emplace_back(i);
            }

            else {
                divisors.emplace_back(i);
                divisors.emplace_back(n / i);
            }
        }
    }
}

long long int maxValue(long long int pieceSize,long long int pieces,map<long long int,map<long long int,long long int>>& m){
    //cout<<"pieceSize and pieces "<<pieceSize<<" "<<pieces<<endl;

    if(m[pieceSize][pieces]!=0){
        //cout<<"Chala Na..."<<endl;
        return m[pieceSize][pieces];
    }
    if(pieceSize==1){
        return pieceSize*pieces;
    }
    vector<long long int> divisor;
    divisor.emplace_back(1);
    getDivisors(pieceSize,divisor);
    //cout<<divisor.size()<<endl;
    long long int maxPath=0;
    for(long long int i=0;i<divisor.size();i++){
        long long int path=maxValue(divisor[i],pieces*(pieceSize/divisor[i]),m);
        if(path>maxPath){
            maxPath=path;
        }
    }
    m[pieceSize][pieces]=maxPath+pieces;
    return maxPath+pieces;

}
int main(){
    long long int n=0;
    cin>>n;
    vector<long long int> sticks(n);
    for(long long int i=0;i<n;i++){
        cin>>sticks[i];
    }

    map<long long int,map<long long int,long long int>> m;
    long long int path=0;
    for(long long int i=0;i<n;i++){
        path+=maxValue(sticks[i],1,m);
    }
    cout<<path<<endl;

    return 0;
}