#include<bits/stdc++.h>

using namespace std;

bool isPrime(long long int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;
 
    // This is checked so that we can skip 
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;
 
    for (long long int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
 
    return true;
}


long long int find(long long int num)
{
        long long int sum=1;
        long long int tnum=1;
        long long int i;
        priority_queue <long long int> v;
        for(i=sqrt(num)+1;i>=2;i--)
        {
                if(num%i==0)
                {       if(isPrime(i))
                        v.push(i);
                        if(isPrime(num/i))
                        v.push(num/i);
                }
        }//cout<<endl;
        long long int div;
        while(!v.empty())
        {
             div=v.top();
                v.pop();
                while(num%div==0)
                {
                        num/=div;
                        tnum*=div;
                        sum+=tnum;
                }
        }
        
        if(num>1)
          sum+=num;
        
        return sum;
}

int main()
{
        int n,i;
        cin>>n;
        vector<long long int >arr(n);
        for(i=0;i<n;i++)
                cin>>arr[i];
        
        long long int sum=0;
        for(i=0;i<n;i++)
        {
                sum+=find(arr[i]);
                //cout<<find(arr[i])<<endl;
        }
        
        
        cout<<sum<<endl;
        return 0;
}