#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  vector<long long> pref(n + 1);
  for (long long i = 0; i < n; i++) pref[i + 1] = pref[i] + a[i];
  long long ans = lower_bound(pref.begin(), pref.end(), (pref[n] + 2 - 1) / 2) -
                  pref.begin();
  cout << ans << '\n';
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
