#include #include #include #include #include #include #include long int power(int a,int b) { int i,j=1; for(i=0;ipower(2,j) && a[i]%power(2,j)==0) { res=res+(a[i]/power(2,j)); //printf("The value is %ld\n",a[i]); j++; } } } return res; } 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; }