#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= M;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % M;
    a = a * a % M;
  }
  return res % M;
}
const int N = 1e5 + 10;
int main() {
  int n;
  cin >> n;
  int id = 1;
  int sum = 0;
  int a[n + 1];
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  sum++;
  int sum1 = 0;
  for (int i = 1; i <= n; ++i) {
    sum1 += a[i];
    if (sum1 >= sum / 2) {
      printf("%d\n", i);
      break;
    }
  }
  return 0;
}
