#include #include #include #include #include #include #include long int longestSequence(int n) { long int sum,res,i; int j,flag; if(n==1) { return 1; } else { for(i=2;isqrt(i)&&n%i==0) { sum=0; res=n; while(res!=0) { sum+=res; res=res/i; } return sum; } } return n+1; } // Return the length of the longest possible sequence of moves. } int main() { int n,i; long int res,sum=0,a; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%ld",&a); res=longestSequence(a); sum+=res; } printf("%ld\n", sum); return 0; }