#include <bits/stdc++.h>

using namespace std;

long prime_div(long n)
{
    long i;
    for(i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return i;
    }
    return n;
}

long longestSequence(long a[],int n) {
  
    long sum=0,sum1=0;
    int i=0;
    for(i=0;i<n;i++){
    	sum=a[i];
    while(a[i]!=1)
    {
        sum=sum+a[i]/prime_div(a[i]);
        a[i]=a[i]/prime_div(a[i]);
    }
    sum1=sum1+sum;
    }
    return sum1;
}

int main() {
    int n;
    scanf("%d",&n);
    long a[n];
    for(int a_i = 0; a_i < n; a_i++){
       scanf("%ld",&a[a_i]);
    }
    long result = longestSequence(a,n);
    printf("%ld\n",result);
    return 0;
}