#include #include #include #include #include #include #include long int longestSequence(int n, long int* a) { int i=0,j,k; long int sum=0; for(i=0;i0){ for(j=2;j<10;j++) { if(a[i]==1) break; else if(a[i]%2!=0&&a[i]%3!=0&&a[i]%5!=0) { sum=sum+a[i]+1; } else if(a[i]%j==0){ break; } }//printf(" %li\n",a[i]); a[i]=a[i]/j; sum=sum+a[i]; //printf(" %li ",sum); } } } return sum; } int main() { int n; scanf("%i", &n); long int *a = malloc(sizeof(long int) * n); for (int 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; }