#include <bits/stdc++.h>
using namespace std;

bool isPrime(long long x) {
    for(long long i=2;i<=(long long)sqrt(x);i++) {
        if(x%i==0) return false;
    }
    return true;
}

long long breaks(long long n) {
    if(n==1) return 1;
    if(n==2) return 3;
    
    long long k=n;
    while(n%2==0) {
        k+=n/2;
        n/=2;
    }
    for(long long i=3;i<=sqrt(n);i+=2) {
        while(n%i == 0) {
            k+=n/i;
            n/=i;
        }
    }
    
    return k+1;
    
}
int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    long long ans=0;
    for(int i=0;i<n;i++) {
        ans+=breaks(a[i]);
    }
    //cout<<"funny: "<<breaks(n);
    cout<<ans<<"\n";
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}