#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a, long sum)
{
    int i=0;
    while(i<a.size())
    {
        int no = 1;
        if(a[i] !=1)
        {
            int temp = a[i];
            while(temp !=1)
            {
                
                vector<int> c;
                
                for(int j=3; j<=temp/2; j+=2)
                {
                    if(temp%j == 0)
                    {
                        c.push_back(j);
                        break;
                    }
                }
                if(temp%2 ==1)
                {
                    c.push_back(temp);
                }
                if(c.size() !=0)
                {
                    temp = temp/c[0];
                    sum +=no;
                    no = no*(c[0]);
                  
                }
                else
                {
                    temp = temp/2;
                    sum+=no;
                    no = no*2;
                }
                
            }
        }
    
        i++;
    }
    return sum;
   
}

int main() {
    int n;
    long sum =0;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++)
    {
       cin >> a[a_i];
        sum+= a[a_i];
    }
    long result = longestSequence(a,sum);
    cout << result << endl;
    return 0;
}