#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
const int N = 1e5 + 10;
int n;
int tr[N];
int ans=1;

LL sum(int l, int r)
{
    LL sum = 0;
    for (int i = l; i <= r && i <= n; i++)sum += tr[i];
    return sum;
}

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)scanf("%d", &tr[i]);

    LL MAX = sum(1, 1), t;
    for (int i = 2; i <= ceil(log(n+1)/log(2)); i++)
    {
        t = sum(pow(2, i - 1), pow(2, i) - 1);
        if (t > MAX)
        {
            ans = i;
            MAX = t;
        }
    }

    cout << ans;
}