#include #include #include #include #include #include #include long long int longestSequence(int n, long int* a) { int long long d=0; while(n>0){ int long long l=1; int t=2; int *s; s=(int*)malloc(5120000); *s=0; while(*a>1){ if(*a%t==0) { s++; *a=*a/t; *s=t; } else {t++; } } int p=1; while(*s!=0) { p=p*(*s); l=l+p; s--; } d=d+l; n--; a++; } return d; } int main() { int n,a_i; scanf("%i", &n); long int *a = malloc(sizeof(long int) * n); for ( a_i = 0; a_i < n; a_i++) { scanf("%li",&a[a_i]); } long long int result = longestSequence(n, a); printf("%lld\n", result); return 0; }