func_code_string: #include <bits/stdc++.h>   const long long int mod = 1e9 + 7;   using namespace std;   bool prime(long long int n) {     if (n <= 1) return false;     if (n <= 3) return true;     if (n % 2 == 0 || n % 3 == 0) return false;     for (long long int i = 5; i * i <= n; i = i + 6)       if (n % i == 0 || n % (i + 2) == 0) return false;     return true;   }   bool isPowerOfTwo(long long int n) {     if (n == 0) return false;     return (ceil(log2(n)) == floor(log2(n)));   }   void SieveOfEratosthenes(long long int n) {     bool prime[n + 1];     memset(prime, true, sizeof(prime));     for (long long int p = 2; p * p <= n; p++) {       if (prime[p] == true) {         for (long long int i = p * p; i <= n; i += p) prime[i] = false;       }     }     for (long long int p = 2; p <= n; p++)       if (prime[p]) cout << p <<    ;   }   long long int modularinv(long long int x, long long int n) {     if (n == 0)       return 1;     else if (n % 2 == 0)       return modularinv((x * x) % mod, n / 2);     else       return (x * modularinv((x * x) % mod, (n - 1) / 2)) % mod;   }   class node {    public:     long long int first;     bool operator<(const node& rhs) const { return first > rhs.first; }   };   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     ;     long long int n, i;     cin >> n;     vector<long long int> v(n);     long long int sum = 0;     for (i = 0; i < n; i++) {       cin >> v[i];       sum += v[i];     }     long long int count = 0;     long long int d;     if (sum % 2 != 0)       sum = sum / 2 + 1;     else       sum = sum / 2;     for (i = 0; i < n; i++) {       count += v[i];       if (count >= sum) {         d = i + 1;         break;       }     }     cout << d;   }   