#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 4;
const int N = 4e5 + 5;
const int LG = 19;
int a[N], st[N * 3], up[N][LG], mx[N];
void build(int v, int l, int r){
if(l == r){
st[v] = a[l];
return;
}
int mid = (l + r) >> 1;
build(v * 2, l, mid);
build(v * 2 + 1, mid + 1, r);
st[v] = max(st[v * 2], st[v * 2 + 1]);
}
int ask(int v, int l, int r, int ql, int qr, int x){
if(ql > r || qr < l || st[v] <= x)
return -1;
if(l == r)
return l;
int mid = (l + r) >> 1;
int rs = ask(v * 2, l, mid, ql, qr, x);
if(rs == -1)
rs = ask(v * 2 + 1, mid + 1, r, ql, qr, x);
return rs;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
long long sum = 0;
unordered_map < long long , int > mp;
mp.reserve(N);
mp[0] = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
sum += a[i];
a[i] = mp.count(sum) == 0 ? -1 : mp[sum] + 1;
mx[i] = max(mx[i - 1], a[i]);
mp[sum] = i;
}
build(1, 1, n);
for(int k = 0; k < LG; k++)
up[n + 1][k] = n + 1;
for(int i = n; i >= 1; i--){
int best = ask(1, 1, n, i, n, i);
if(best == -1)
best = n + 1;
up[i][0] = best;
for(int k = 1; k < LG; k++)
up[i][k] = up[up[i][k - 1]][k - 1];
}
int q;
cin >> q;
while(q--){
int l, r;
cin >> l >> r;
int lst = -1, sz = 0, i = 0;
int lo = 1, hi = r;
while(hi >= lo){
int mid = (lo + hi) >> 1;
if(mx[mid] < l){
i = mid;
lo = mid + 1;
}
else hi = mid - 1;
}
i++;
if(i > r){
cout << "0\n";
continue;
}
int ans = 1, cur = i;
for(int k = LG - 1; k >= 0; k--){
if(up[cur][k] <= r){
cur = up[cur][k];
ans += (1 << k);
}
}
cout << ans << "\n";
}
}
/*
3 2 2 2 4
3 3 3 2 4
*/
