#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

namespace FastIO

{    //使用时直接调用 read(x)即可，

    const static int MX=1e6;

    bool IOerror=;

    char nc()

    {

        static char buf[MX],*p1=buf+MX,*pend=buf+MX;

        if(p1==pend)

        {

            p1=buf;

            pend=buf+fread(buf,,MX,stdin);

            if(pend==p1)

            {

                IOerror=;

                return -;

            }

        }

        return *p1++;

    }

    inline bool blank(char ch)

    {

        return ch==' '||ch=='\n'||ch =='\r'||ch =='\t';

    }

    inline int read(int& x)

    {

        char ch;

        int sign=;

        while(blank(ch=nc()));

        if(IOerror) return ;

        if(ch=='-') sign=-,ch=nc();

        for(x=ch-''; (ch=nc())>=''&&ch<=''; x=x*+ch-'');

        x*=sign;

        return ;

    }

    inline int read(LL& x)

    {

        char ch;

        int sign=;

        while(blank(ch=nc()));

        if(IOerror) return ;

        if(ch=='-') sign=-,ch=nc();

        for(x=ch-''; (ch=nc())>=''&&ch<=''; x=x*+ch-'');

        x*=sign;

        return ;

    }

}

using namespace FastIO;

const int N=2e6+;

int a[N],b[N];

int solve(int n)

{

    for(int i=;i<n;i++) read(a[i]),a[i+n]=a[i];

    for(int i=;i<n;i++) read(b[i]),b[i+n]=b[i];

    int ret=,fuck=;

    int sum1=,sum2=,be=;

    for(int i=;i<*n&&be<n;i++)

    {

        sum1+=a[i];

        sum2+=a[i]-b[i];

        if(sum2<||i-be+==n)

        {

            if(sum1>fuck) ret=be,fuck=sum1;

            sum1=sum2=;

            be=i+;

        }

    }

    return ret;

}

int main()

{

//    freopen("test.in","r",stdin);

    int n;

    while(read(n))

        printf("%d\n",solve(n));

}