#include #include #include #include #include #include #include long int longestSequence(int a_size, long int* a) { int sum=0,i,temp,ctr; for(i=0;i1) { ctr=ctr+temp; temp=temp/2; } sum=sum+ctr+1; } 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; }