#include #include #include #include #include #include #include long long int sum = 0; long long int longestSequence(int a_size, long long int* a) { for(int i=0;i1 && k%2 == 0) sum = sum+array[k-1]; } } if(a[i] == 1) sum = 1; else sum = sum+1+a[i]; free(array); } return sum; } int main() { int n; scanf("%i", &n); long long int *a = malloc(sizeof(long int) * n); for (int a_i = 0; a_i < n; a_i++) { scanf("%lli",&a[a_i]); } long long int result = longestSequence(n, a); printf("%lld\n", result); return 0; }