cb2

#include <iostream>
#define N 100001
using namespace std;
int sume[N],M[N],x,s;

int cautbin(int st,int dr)
{
    if(st>dr)
        return dr;
    int mij=(st+dr)/2;
    if(sume[mij]>s||M[mij]>x)
        cautbin(st,mij-1);
    else
        cautbin(mij+1,dr);
}

int main()
{
    int n;
    cin>>n;
    int a,MAX=0;
    for(int i=1;i<=n;++i)
    {
        cin>>a;
        sume[i]=sume[i-1]+a;
        if(a>MAX)
            M[i]=MAX=a;
        else
            M[i]=MAX;
    }
    int q;
    cin>>q;
    while(q--)
        cin>>x>>s,cout<<cautbin(0,n)<<'\n';
    return 0;
}