#include using namespace std; long w(long a) { long sum=0; long nic=1; long y=1; while(y<=a) { if(y==a) { sum+=1; break; } long o=a/y; long i=2; long j=o; for( i=2;i<=sqrt(o);i++) { if(o%i==0) { j=i; break; } } sum+=o; y=y*j; } return sum; } long longestSequence(vector a) { // Return the length of the longest possible sequence of moves. long sum=0; for(auto it:a) sum+=w(it); return sum; } int main() { int n; cin >> n; vector a(n); for(int a_i = 0; a_i < n; a_i++){ cin >> a[a_i]; } long result = longestSequence(a); cout << result << endl; return 0; }