#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
long long a[200005];
long long pref[200005];
int n;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &a[i]);
    if (i)
      pref[i] = a[i] + pref[i - 1];
    else
      pref[i] = a[i];
  }
  int ans = 0;
  for (int i = 0; i < n; ++i)
    if (pref[i] >= (pref[n - 1] / 2 + pref[n - 1] % 2)) {
      ans = i;
      break;
    }
  printf("%d\n", ans + 1);
  return 0;
}
