#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll mod=1e12;
ll prime(ll n)
{
  bool flag = true;

  for(ll i = 2; i <= sqrt(n); ++i)
  {
      if(n%i == 0)
      {
          flag = false;
          break;
      }
  }
  return flag;
}
int main()
{
    ll te,n;cin>>n;
    ll a[n],sum=0;
    for(ll i=1;i<=n;i++)cin>>a[i];
    for(ll i=1;i<=n;i++){
       if(prime(a[i])){if(a[i]>1)sum=(sum+a[i]+1);else sum=(sum+1);}
       else {
            while(a[i]>0)
            {int c=0;
                sum=(sum+a[i]);//cout<<sum<<endl;
              for(ll j=2;j<=sqrt(a[i]);j++)
            if(a[i]%j==0&&(a[i]%(a[i]/j)==0)){te=j;c++;break;}
            if(c==0){te=a[i];sum+=1;break;}
            a[i]/=te;
            }
       }
    }cout<<sum<<endl;
}