#include <bits/stdc++.h> using namespace std; vector<long long> P; long long longestSequence(vector <long> a) { long long ANS=0; for (int i=0; i<a.size(); i++) { long long ans=0,np=1,q=a[i]; for(int j=P.size()-1; j>=0; j--) { while(a[i]%P[j]==0) { ans+=np; np*=P[j]; a[i]/=P[j]; } } if(a[i]>1) ans*=a[i], ans++; ans+=q; ANS+=ans; } return ANS; } int p[1000009]; int main() { int n; for (int i=2; i<=10000; i++) if(p[i]==0) { for (int j=2*i; j<=1000000; j+=i) p[j]=1; } for (int i=2; i<=1000000; i++) if(p[i]==0) P.push_back(i); cin >> n; vector<long> a(n); for(int a_i = 0; a_i < n; a_i++){ cin >> a[a_i]; } long long result = longestSequence(a); cout << result << endl; return 0; }