#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define pii pair<int, int>
#define pll pair<long long, long long>
#define V  vector
#define pb  push_back
#define mp  make_pair
#define pq priority_queue
#define FIN(x) freopen(x,"r",stdin)
#define FOUT(x) freopen(x,"w",stdout)
#define ALL(x) x.begin(),x.end()
#define M(a,x) memset(a,x,sizeof(a))
#define S(x) scanf("%d",&x)
#define Sl(x) scanf("%lld",&x)
#define scs(x) scanf("%s",x);
#define SZ(x) (int)x.size()
#define print(x) printf("%d",x);
#define nl printf("\n")
#define fr first
#define se second
#define printl(x) printf("%lld",x)
#define F(i,a,n) for(int i=a;i<n;i++)
#define INF 4000000000000000000LL
#define LL long long

const int N = 1e5+5;
LL a[N];

LL f(LL num) {
  int fl = 0;
  for(LL i = 2 ; i*i <=num ; i++) {
    if( num % i == 0) {
      fl = i;
      break;
    }
  }
//  cout << fl <<" "<<num << endl;
  if(num == 1) return 0;
  if(!fl) {
    return 1;
  }
  return num/fl + f(num/fl);
}
int main() {
  int n;
  cin >> n;
  LL ans = 0;
//  cout << f(2) << endl;
  for(int i = 0 ; i < n ; i++) {
    Sl(a[i]);
    ans += a[i] + f(a[i]);
//    cout << a[i] + f(a[i]) <<" ";
  }
  cout << ans << endl;
}