#include #include #include #include #include #include #include int main() { int n; scanf("%i", &n); long int sum=0;//,rem=0,val; long int *a = malloc(sizeof(long int) * n); for (int a_i = 0; a_i < n; a_i++) { scanf("%li",&a[a_i]); sum=sum+a[a_i]; while(a[a_i]>0) { if(a[a_i]%2==0) sum=sum+(a[a_i]/2)-1; else sum=sum+(a[a_i]/2); a[a_i]=a[a_i]/2; } } // long int result = longestSequence(n, a); printf("%ld\n", sum); return 0; }