#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int INF = 1e9;
const int MAXN = 1e5 + 1;
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  long long sum = 0;
  for (auto& x : a) {
    cin >> x;
    sum += x;
  }
  long long cur = 0;
  for (int i = 0; i < int((int)(a).size()); i++) {
    cur += a[i];
    if (cur * 2 >= sum) {
      cout << i + 1;
      return;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
}
