#include #include #include #include #include #include #include long int dive(long int n) { long int j,ans=0; for(j=2;j<=sqrt(n);j++) { if(n%j==0) { ans=j; break; } } if(j==n) { ans=1; } return ans; } long int longestSequence(int n, long int* a) { long int sum=0,i,j; for(i=0;i1) { sum = sum + (a[i]/dive(a[i])); a[i] = (a[i]/dive(a[i])); } } } 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; }