#include <bits/stdc++.h>
using namespace std;
long long a[200002];
long long lo, n;
int bs() {
  int s = 0, en = n - 1;
  while (s < en) {
    int mid = (en + s + 1) / 2;
    if (a[mid] == lo) return mid;
    if (a[mid] < lo)
      s = mid + 1;
    else
      en = mid;
  }
  return en;
}
int main() {
  cin >> n;
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
    lo += a[i];
    if (i) a[i] += a[i - 1];
  }
  (++lo) /= 2;
  int ii = lower_bound(a, a + n, lo) - a;
  cout << ++ii;
  return 0;
}
