func_code_string: #include <bits/stdc++.h>   long long mod = 1e9 + 7, mod2 = 998244353;   const int N = int(3e5) + 999;   using namespace std;   long long fac[10000000];   long long gcd(long long x, long long y) {     if (y == 0) return x;     return gcd(y, x % y);   }   long long fexp(long long a, long long b, long long m) {     long long ans = 1;     while (b) {       if (b & 1) ans = ans * a % m;       b /= 2;       a = a * a % m;     }     return ans;   }   long long inverse(long long a, long long p) { return fexp(a, p - 2, p); }   long long ncr(long long n, long long r, long long p) {     if (r == 0) return 1;     return (fac[n] * inverse(fac[n - r], p) % p * inverse(fac[r], p) % p) % p;   }   vector<long long> za(string s) {     long long n = s.size();     vector<long long> z(n);     long long x = 0, y = 0, p = 0;     for (long long i = 1; i < n; i++) {       z[i] = max(p, min(z[i - x], y - i + 1));       while (i + z[i] < n && s[z[i]] == s[i + z[i]]) {         x = i;         y = i + z[i];         z[i]++;       }     }     return z;   }   void subset(long long a[], long long k) {     for (int i = 1; i < pow(2, k); i++) {       for (int j = 0; j < k; j++) {         if (i & 1 << j) {           cout << a[j] <<    ;         }       }       cout << endl;     }   }   vector<long long> pr(string s) {     long long n = s.length();     vector<long long> pi(n);     for (int i = 1; i < n; i++) {       int j = pi[i - 1];       while (j > 0 && s[i] != s[j]) j = pi[j - 1];       if (s[i] == s[j]) j++;       pi[i] = j;     }     return pi;   }   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     long long n, val;     cin >> n;     long long a[n], c1 = 0, c2 = 0, ans = 0, t = 0;     for (long long i = 0; i < n; i++) {       cin >> a[i];       if (t % 2 == 0)         c1++;       else         c2++;       if (a[i] < 0) t++;       if (t % 2 == 0)         ans += c1;       else         ans += c2;     }     cout << n * (n + 1) / 2 - ans <<     << ans;     return 0;   }   