C. Alice, Bob and Chocolate

#include <bits/stdc++.h>
using namespace std;
#define ll long long

void ez()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

bool comp(ll &a, ll &b)
{
    return a > b;
}

void solve()
{
    ll n, AliceSum = 0, BobSum = 0, cnt1 = 0, cnt2 = 0;
    cin >> n;
    vector<ll> v(n);
    for (auto &i : v)
        cin >> i;

    ll f = 0, l = n - 1;

    while (f < l)
    {
        if (v[l] > v[f])
        {
            cnt1++;
            v[l] -= v[f];
            AliceSum += v[f];
            v[f] = 0;
            f++;
        }
        else if (v[f] > v[l])
        {
            cnt2++;
            v[f] -= v[l];
            BobSum += v[l];
            v[l] = 0;
            l--;
        }
        else
        {
            cnt1++, cnt2++;
            AliceSum += v[f];
            BobSum += v[l];
            v[f] = v[l] = 0;
            f++, l--;
        }
    }
    if ((v[l] or v[f]))
    {
        if (n % 2)
            (AliceSum >= BobSum ? cnt1++ : cnt2++);
        else
        {
            (v[f] ? cnt1++ : cnt2++);
        }
    }
    cout << cnt1 << " " << cnt2 << endl;
}

int main()
{
    ez();
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}