#include <iostream>
#include <vector>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin>>n;
vector<int> dist(n-1);
for(int i=0; i<n-1; i++)
cin>>dist[i];
vector<int> pos(n);
pos[0] = 0;
for(int i=1; i<n; i++)
pos[i] = pos[i-1] + dist[i-1];
int total_length = pos[n-1];
int min_max = total_length;
vector<int> candidates;
for(int i=0; i<n; i++)
{
long long max_dist = max(pos[i], total_length-pos[i]);
if(max_dist < min_max)
{
min_max = max_dist;
candidates.clear();
candidates.push_back(i+1);
}
else if(max_dist == min_max)
{
candidates.push_back(i+1);
}
}
for(int x : candidates)
cout<<x<<'\n';
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIAppbnQgbWFpbigpIAp7CiAgICBpb3M6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKG51bGxwdHIpOwogICAgCiAgICBpbnQgbjsKICAgIGNpbj4+bjsKICAgIAogICAgdmVjdG9yPGludD4gZGlzdChuLTEpOwogICAgCiAgICBmb3IoaW50IGk9MDsgaTxuLTE7IGkrKykKICAgICAgICBjaW4+PmRpc3RbaV07CiAgICAKICAgIHZlY3RvcjxpbnQ+IHBvcyhuKTsKICAgIHBvc1swXSA9IDA7CiAgICAKICAgIGZvcihpbnQgaT0xOyBpPG47IGkrKykKICAgICAgICBwb3NbaV0gPSBwb3NbaS0xXSArIGRpc3RbaS0xXTsKICAgICAgICAKICAgIGludCB0b3RhbF9sZW5ndGggPSBwb3Nbbi0xXTsKICAgIGludCBtaW5fbWF4ID0gdG90YWxfbGVuZ3RoOwogICAgCiAgICB2ZWN0b3I8aW50PiBjYW5kaWRhdGVzOwogICAgCiAgICBmb3IoaW50IGk9MDsgaTxuOyBpKyspCiAgICB7CiAgICAgICAgbG9uZyBsb25nIG1heF9kaXN0ID0gbWF4KHBvc1tpXSwgdG90YWxfbGVuZ3RoLXBvc1tpXSk7CiAgICAgICAgCiAgICAgICAgaWYobWF4X2Rpc3QgPCBtaW5fbWF4KQogICAgICAgIHsKICAgICAgICAgICAgbWluX21heCA9IG1heF9kaXN0OwogICAgICAgICAgICBjYW5kaWRhdGVzLmNsZWFyKCk7CiAgICAgICAgICAgIGNhbmRpZGF0ZXMucHVzaF9iYWNrKGkrMSk7CiAgICAgICAgfQogICAgICAgIAogICAgICAgIGVsc2UgaWYobWF4X2Rpc3QgPT0gbWluX21heCkKICAgICAgICB7CiAgICAgICAgICAgIGNhbmRpZGF0ZXMucHVzaF9iYWNrKGkrMSk7CiAgICAgICAgfQogICAgfQogICAgCiAgICBmb3IoaW50IHggOiBjYW5kaWRhdGVzKQogICAgICAgIGNvdXQ8PHg8PCdcbic7CgogICAgcmV0dXJuIDA7Cn0KICAgIAogICAgCiAgICAKICAgIA==