#include "bits/stdc++.h" #define REP(i,n) for(ll i=0;i=0;--i) #define FOR(i,m,n) for(ll i=m;i=ll(m);--i) #define ALL(v) (v).begin(),(v).end() #define UNIQUE(v) v.erase(unique(ALL(v)),v.end()); #define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; } #define INF 1000000001ll #define MOD 1000000007ll #define EPS 1e-9 const int dx[8] = { 1,1,0,-1,-1,-1,0,1 }; const int dy[8] = { 0,1,1,1,0,-1,-1,-1 }; using namespace std; typedef long long ll; typedef vector vi; typedef vector vl; typedef vector vvi; typedef vector vvl; typedef pair pii; typedef pair pll; ll max(ll a, int b) { return max(a, ll(b)); } ll max(int a, ll b) { return max(ll(a), b); } ll min(ll a, int b) { return min(a, ll(b)); } ll min(int a, ll b) { return min(ll(a), b); } int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; vl v(n); REP(i, n)cin >> v[i]; vector isprime(1000003,1); isprime[0] = false; isprime[1] = false; REP(i, isprime.size()) { if (isprime[i]) { for (ll j = 2; i*j < isprime.size(); ++j) { isprime[i*j] = false; } } } ll ans = 0; REP(i, n) { ll cnt = 1, tmp = 0; vl div; ll a = v[i]; REP(i, isprime.size()) { if (!isprime[i])continue; while (a%i == 0) { a /= i; div.push_back(i); } } if (a != 1)div.push_back(a); RREP(i, div.size()) { tmp += cnt; cnt *= div[i]; } tmp += cnt; ans += tmp; } cout << ans << endl; }