## Algorithm

A. Equator
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Polycarp has created his own training plan to prepare for the programming contests. He will train for n days, all days are numbered from 11 to n, beginning from the first.

On the i-th day Polycarp will necessarily solve ai�� problems. One evening Polycarp plans to celebrate the equator. He will celebrate it on the first evening of such a day that from the beginning of the training and to this day inclusive he will solve half or more of all the problems.

Determine the index of day when Polycarp will celebrate the equator.

Input

The first line contains a single integer n (1n2000001≤�≤200000) — the number of days to prepare for the programming contests.

The second line contains a sequence a1,a2,,an�1,�2,…,�� (1ai100001≤��≤10000), where ai�� equals to the number of problems, which Polycarp will solve on the i-th day.

Output

Print the index of the day when Polycarp will celebrate the equator.

Examples
input
Copy
41 3 2 1
output
Copy
2
input
Copy
62 2 2 2 2 2
output
Copy
3
Note

In the first example Polycarp will celebrate the equator on the evening of the second day, because up to this day (inclusive) he will solve 44 out of 77 scheduled problems on four days of the training.

In the second example Polycarp will celebrate the equator on the evening of the third day, because up to this day (inclusive) he will solve 66 out of 1212 scheduled problems on six days of the training.

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int main() {
int n, a[200001] = {0}, tot1 = 0;
cin >> n;
for(int i = 0; i < n; ++i) {
cin >> a[i];
tot1 += a[i];
}

if(tot1 % 2 == 1)
++tot1;

int i = 0, tot = 0;
while(i < n && tot < tot1 / 2) {
tot += a[i];
++i;
}

cout << i << endl;

return 0;
}
Copy The Code &

Input

cmd
4
1 3 2 1

Output

cmd
2