#include <bits/stdc++.h>
const int MAXN = 200000 + 10;
int n;
int perm[MAXN];
long long sum;
void solve() {
  long long cur = 0;
  for (int i = 1; i <= n; i++) {
    cur += perm[i];
    if (cur * 2 >= sum) {
      printf("%d\n", i);
      return;
    }
  }
}
void init() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &perm[i]), sum += perm[i];
}
int main(void) {
  init();
  solve();
  return 0;
}
