#include #include #include #include #include #include #include long int longestSequence(int a_size, long int* a) { static long int x; for(int i=0;i<=a_size-1;i++) { if(a[i]==1) { x+=1; continue; } else if(a[i]%2==0) { x+=a[i]; while(a[i]%2==0) { a[i]=a[i]/2; x+=a[i]; } x+=1; } else { x+=a[i]+1;; } } //x=x+1; return (x); } 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; }