#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
    int n;
    fin >> n;
    int v[n];
    for (int i = 0; i < n; ++i)
        fin >> v[i];
    int maxim, maximGlobal, dr = 0, k = 1;
    maxim = maximGlobal = v[0];
    for (int i = 1; i < n; ++i)
    {
        maxim = max(v[i], maxim + v[i]);
        if (maxim > maximGlobal)
        {
            dr = i;
            maximGlobal = maxim;
        }
    }
    fout << dr + 1;
    return 0;
}