//submitted by HimJ
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define pb push_back
#define fi first
#define se second
#define fr(i,s,e) for(i=s;i<e;i++)
#define be begin
#define ms(arr,val) memset(arr,val,sizeof(arr))

using namespace std;
unordered_map<long,long> ans;
int prime[1000000];
long func(long n)
{
    if(ans[n])
        return ans[n];
    if(n==1)
        return 0;
    /*if(isprime(n))
    {
        ans[n]=1+n;
    }*/
    long val=0;
    int i=2, flag=0;
    long a=n;
    while(a!=0&&a%2==0)
    {
       
        val+=a;
        a/=2;
    }
      i=3;
    for(;i<=sqrt(a);i+=2)
    {
        if(a%i==0)
        {
            val+=a;
            a/=i;
             val+=func(a);
            flag=1;
            break;
        }
    }
    if(flag==0)
    {
        if(a==1)
            a=0;
        val+=a;
    }
        
    
    return ans[n]=val;
}

int main() {
     ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int i,j,n;
  
      long val=0;
    cin >> n;
    vector<long> a(n);
    ans[1]=0;
    ans[2]=2;
    ans[3]=3;
    func(1e12-1);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
        val+=func(a[a_i])+1;
       //cout<<ans[a[a_i]]<<" ";
    }
    cout << val << endl;
    return 0;
}