#include <bits/stdc++.h>
using namespace std;
const int N = 4e5+5;
int up[N][20];
vector<int> idx[N];
// for(int i=1; i<=n; i++)
void solve(){
int n; cin >> n;
for(int i=1; i<=n; i++) {int x; cin >> x; up[i][0] = up[i-1][0] + x; };
unordered_map<int, int> last;
for(int i=0; i<=n; i++) {
int kp = up[i][0];
if(last.count(up[i][0])) up[i][0] = last[up[i][0]];
else up[i][0] = -1;
last[kp] = i;
}
last.clear();
vector<int> nxt(n+1);
for(int i=0; i<=n; i++) if(up[i][0] != -1) idx[up[i][0]].push_back(i);
priority_queue<int> pq;
for(int i=n; i>=0; i--){
for(int j: idx[i]) pq.push(-j);
if(pq.empty()) nxt[i] = n+1;
else nxt[i] = -pq.top();
}
for(int i=n; i>=0; i--){
up[i][0] = nxt[i];
for(int k=1; k<20; k++) {
if (up[i][k-1] > n) up[i][k] = n + 1;
else up[i][k] = up[up[i][k-1]][k-1];
}
}
nxt.clear();
int q; cin >> q;
while(q--){
int l, r; cin >> l >> r; l--;
long long ans = 0;
for(int b=19; b>=0; b--){
if(up[l][b] > r) continue;
ans += 1<<b;
l = up[l][b];
}
cout << ans << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
