//2020 A组
//F 完全二叉树的权值

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

typedef long long LL;

const int N = 100010;

int main()
{
    int n;
    LL arr[N];
    cin>>n;
    for(int i=1;i<=n;i++) scanf("%lld",&arr[i]);
    LL ans=0;
    int deep=0;
    int tdeep=1;
    int ans_deep=1;
    for(int i=1;i<=n;i+=pow(2,deep-1))
    {
        LL sum=0;
        deep++;
        for(int j=i;j<i+pow(2,deep-1) && j<=n;j++)  //完全二叉树的最后一层可能不满
        {
            sum+=arr[j];
        }

        if(sum>ans)
        {
            ans=sum;
            ans_deep=deep;
        }

    }
    cout<<ans_deep;
}