#include #include #include #include #include #include #include long int longestSequence(int a_size, long int* a) { int i, count, j; long int total=0; for(i=0;i1) { if(a[i]%2==0) { a[i] = a[i]/2; sum = sum+a[i]; } else { for(j=3;j<=a[i]/2;j+=2) { if(a[i]%j==0) { a[i]=a[i]/j; sum =sum+a[i]; count++; break; } } if(count==0) { sum++; break; } } count =0; } total =total+ sum; } return (total); } 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 int result = longestSequence(n, a); printf("%ld\n", result); return 0; }