#include<bits/stdc++.h>
using namespace std;
const int MAXN=400001,LOG=5;
int kiri[MAXN],nxt[MAXN],enter[MAXN],pa[LOG][MAXN];
long long pref[MAXN];
unordered_map<long long,int> idx;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int N,Q,L,R;
cin >> N;
memset(kiri,-1,sizeof(kiri));
pref[0]=0;
idx[0]=0;
for(int i=1;i<=N;i++){
cin >> pref[i];
pref[i]+=pref[i-1];
if(idx.count(pref[i]))kiri[i]=idx[pref[i]];
idx[pref[i]]=i;
}
idx.clear();
int mini=N+1;
for(int i=N;i>=0;i--){
//find j minimum st j>i and kiri[j]>=i
if(enter[i])mini=min(mini,enter[i]);
pa[0][i]=mini;
for(int j=1;j<LOG;j++){
pa[j][i]=pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][pa[j-1][i]]]]]]]]]]]]]];
if(pa[j][i]==0)pa[j][i]=N+1;
}
if(kiri[i]!=-1)enter[kiri[i]]=i;
}
cin >> Q;
while(Q--){
cin >> L >> R;
int ans=0,now=pa[0][L-1];
if(now>R){
cout << 0 << '\n';
continue;
}
int pkt=1;
for(int i=1;i<=LOG-1;i++)pkt*=14;
for(int i=LOG-1;i>=0;i--){
for(int j=0;j<14;j++){
if(pa[i][now]<=R){
ans+=pkt;
now=pa[i][now];
}
}
pkt/=14;
}
cout << ans+1 << '\n';
}
return 0;
}
