#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) 
{
    long int ans=0;
    long int sum=0;
    for(int i=0;i<a.size();i++)
    {
        long int temp=a[i];
        long int fact=temp/2;
        while(temp>1)
        {
            fact=temp/2;
            while(temp%fact!=0)
            {
                fact--;
            }
            ans=ans+fact;
            temp=fact;
        }
        sum=sum+a[i];
    }
    return ans+sum;
}

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;
}