// GPT code
#include <bits/stdc++.h>
using namespace std;
const int N = 400000 + 5;
int n;
int nxt[N], to[N], cnt[N], block_id[N];
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
vector<long long> a(n+1), pre(n+1);
for(int i=1;i<=n;i++){
cin >> a[i];
pre[i] = pre[i-1] + a[i];
}
// coordinate compression
vector<long long> vals = pre;
sort(vals.begin(), vals.end());
vals.erase(unique(vals.begin(), vals.end()), vals.end());
auto get_id = [&](long long x){
return lower_bound(vals.begin(), vals.end(), x) - vals.begin();
};
vector<int> last(vals.size(), -1);
vector<int> idx(n+1, 1e9);
for(int i=0;i<=n;i++){
int id = get_id(pre[i]);
if(last[id] != -1){
idx[last[id]] = min(idx[last[id]], i);
}
last[id] = i;
}
int mn = 1e9;
for(int i=n;i>=0;i--){
if(idx[i] != (int)1e9) mn = min(mn, idx[i]);
if(mn == (int)1e9) nxt[i] = n+1;
else nxt[i] = mn;
}
// sqrt decomposition
int B = sqrt(n) + 1;
for(int i=0;i<=n;i++) block_id[i] = i / B;
for(int i=n;i>=0;i--){
if(nxt[i] > n){
to[i] = n+1;
cnt[i] = 0;
}
else if(block_id[i] == block_id[nxt[i]]){
to[i] = to[nxt[i]];
cnt[i] = cnt[nxt[i]] + 1;
}
else{
to[i] = nxt[i];
cnt[i] = 1;
}
}
int q; cin >> q;
while(q--){
int l, r;
cin >> l >> r;
l--;
int ans = 0;
while(l <= r){
if(to[l] <= r){
ans += cnt[l];
l = to[l];
}
else{
if(nxt[l] <= r){
ans++;
l = nxt[l];
} else break;
}
}
cout << ans << '\n';
}
return 0;
}
