#include <bits/stdc++.h>
using namespace std;
int binarysearch(long long int res[], long long int key, int size) {
  int low, high, mid;
  low = 0;
  high = size - 1;
  while (low <= high) {
    mid = (low + high) / 2;
    if (res[mid] <= key) {
      low = mid + 1;
    } else {
      high = mid - 1;
    }
  }
  if (res[low - 1] == key) {
    return low - 1;
  } else
    return low;
}
int main() {
  int n;
  cin >> n;
  long long int arr[n];
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  long long int res[n];
  res[0] = arr[0];
  for (int i = 1; i < n; i++) {
    res[i] = res[i - 1] + arr[i];
  }
  long long int key;
  if (res[n - 1] % 2 == 0) {
    key = res[n - 1] / 2;
  } else {
    key = res[n - 1] / 2 + 1;
  }
  int index = binarysearch(res, key, n);
  cout << index + 1;
  return 0;
}
