#include <bits/stdc++.h>
using namespace std;
int v[400001];
struct numbers{
int nr,id;
}ps[400001];
int jump[400000][17];
int f[400001];
int main(){
int n,i,nr = 2e9,j,l,r,cur = -1,cnt = -1;
cin>>n;
for(i = 0;i < n;i++){
cin>>v[i];
ps[i + 1] = {ps[i].nr + v[i],i + 1};
}
sort(ps,ps + n + 1,[&](numbers a,numbers b){
return a.nr < b.nr;
});
for(i = 0;i <= n;i++){
if(cur != ps[i].nr){
cur = ps[i].nr;
cnt++;
}
ps[i].nr = cnt;
}
sort(ps,ps + n + 1,[&](numbers a,numbers b){
return a.id < b.id;
});
f[ps[n].nr] = n;
for(i = n - 1;i >= 0;i--){
if(f[ps[i].nr] != 0){
nr = min(nr,f[ps[i].nr]);
}
jump[i][0] = (nr==2e9?n + 1:nr);
f[ps[i].nr] = i;
}
for(i = 1;i <= 16;i++){
for(j = 0;j < n;j++){
jump[j][i] = (jump[j][i - 1] >= n?n + 1:jump[jump[j][i - 1]][i - 1]);
}
}
int q;
cin>>q;
for(i = 0;i < q;i++){
cin>>l>>r;l--;r--;
int cur = l,ans = 0;
for(j = 16;j >= 0;j--){
if(cur != n && jump[cur][j] <= r + 1){
cur = jump[cur][j];
ans+=(1<<j);
}
}
cout<<ans<<'\n';
}
return 0;
}
