#include<bits/stdc++.h>
using namespace std;
typedef long long int uli;
uli solve(vector<pair<uli,uli> >&p){
  if(p.size()==1 && p[0].second==1)return 1;
  uli pi=p.back().first;
  p.back().second--;
  if(p.back().second==0)p.pop_back();
  return pi*solve(p)+1;
}
int main(){
  int t;
  scanf("%d",&t);
  uli ans=0;
  while(t--){
    uli n;
    scanf("%lld",&n);
    if(n==1){
      ans++;
      continue;
    }
    vector<pair<uli,uli> >d;
    ans+=n;
    for(uli p=2;p*p<=n;p++)if(n%p==0){
      int e=0;
      while(n%p==0)n/=p,e++;
      d.push_back({p,e});
    }
    if(n!=1)d.push_back({n,1});
    ans+=solve(d);
  }
  cout<<ans<<endl;
  return 0;
}