// Template by [thunder_blade]
// IIIT ALLAHABAD
// includes :)

#include <bits/stdc++.h>
using namespace std;
#define TEST  int test_case; cin>>test_case; while(test_case--)
#define all(v) (v).begin(),(v).end()
#define fi  first
#define se  second
#define pb push_back
#define mp make_pair
#define ll long long int
#define SPEED ios_base::sync_with_stdio(false);  cin.tie(0);  cout.tie(0);
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define pf(x) printf("%f\n",x)
#define ps(x) printf("%s\n",x)
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define sf(x) scanf("%f",&x)
#define ss(x) scanf("%s",x)
#define pis(x) printf("%d ",x)
#define pls(x) printf("%lld ",x)
#define pfs(x) printf("%f ",x)
#define pss(x) printf("%s ",x)
#define FOR(i,a,b) for(i=a;i<b;i++)
#define mod 1000000007

const int N = 1000005;
int mrk[N];
vector<ll>v;

void se()
{
  for(int i=4;i<N;i+=2){
    mrk[i]=1;
  }
  for(int i=3;i<N;i+=2){
    if(!mrk[i]){
      for(int j=2*i;j<N;j+=i){
        mrk[j]=1;
      }
    }
  }
  for(int i=2;i<N;i++){
    if(!mrk[i])v.pb(i);
  }
}
int main()
{
  se();
  int n;
  si(n);
  ll sum = 0;
  for(int te=1;te<=n;te++){
    ll x;
    sl(x);
    ll pre = 1;
    vector<ll>ans;
    for(int i=0;i<v.size() && v[i]<=x;i++){
      while(x%v[i]==0){
        x/=v[i];
        ans.pb(v[i]);
      }
    }
    if(x>1){
      ans.pb(x);
    }
    sort(all(ans));
    for(int i=ans.size()-1;i>=0;i--){
      pre = pre*ans[i];
      sum += pre;
    }
    sum++;
  }
  pl(sum);
}