#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long long int first(long long int a){
    for(long long int i=3;i<=a;i+=2)
        if(a%i==0)
            return i; 
    return a;
}
int isprime(long long int a){
    for(long long int i = 2; i <= sqrt(a); i++) {
       if(a% i == 0) {
          return 0;
       }    
   }
    return 1;
}
int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    /* Enter your code here. Print output to STDOUT */   
    long long int sum=0;
    for(long long int j=0;j<n;j++){
            if(a[j]==1){
                sum+=1;
            }
            while(a[j]!=1){
                if(isprime(a[j])){
                    sum+=a[j]+1;
                    a[j]=1;
                }
                else if(a[j]%2==0){
                    sum+=a[j];
                    a[j]/=2;
                }
                else{
                    sum+=a[j];
                    long long int k=first(a[j]);
                    a[j]=a[j]/k;
                }
            }
        
    }
    cout<<sum;
 
    return 0;
}