#include using namespace std; typedef long long ll; vector primes; void fillPrimes(){ int a[1000000] = {0}; for(int i = 2;i<1000000;i++){ if(a[i] == 0){ primes.push_back(i); for(int j = i+i;j<1000000;j+=i) a[i] = 1; } } } ll longestSequence(vector a) { // Return the length of the longest possible sequence of moves. fillPrimes(); ll ans = 0; for(int i = 0;i 1);j++){ while(a[i]%primes[j] == 0){ x = 1 + primes[j]*x; a[i]/=primes[j]; } } if(a[i] > 1) x = 1 + a[i]*x; ans += x; } return ans; } int main() { int n; cin >> n; vector a(n); for(int a_i = 0; a_i < n; a_i++){ cin >> a[a_i]; } ll result = longestSequence(a); cout << result << endl; return 0; }