题意：有n个物品，每个物品吃掉的时间是a[i]，一个人从左边开始吃，一个人从右边开始吃，如果两个人同时吃到了一个东西，算左边的。最后问你左边吃了多少个，右边吃了多少个

思路：直接暴力扫吧...

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+7;
long long a[maxn];
int main()
{
    int n;scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%lld",&a[i]);
    long long t1=0,t2=0;
    int num1=0,num2=0;
    int l=1,r=n;
    while(l<=r)
    {
        if(t1<=t2)t1+=a[l++],num1++;
        else t2+=a[r--],num2++;
    }
    cout<<num1<<" "<<num2<<endl;
}

Description

Alice and Bob like games. And now they are ready to start a new game. They have placed n

How many bars each of the players will consume?

Input

The first line contains one integer n (1 ≤ n ≤ 10⁵) — the amount of bars on the table. The second line contains a sequence t₁, t₂, ..., t_n(1 ≤ t_i ≤ 1000), where t_i is the time (in seconds) needed to consume the i-th bar (in the order from left to right).

Output

Print two numbers a and b, where a is the amount of bars consumed by Alice, and b

Sample Input

Input

5 2 9 8 2 7

Output

2 3