#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using lli = long long;
const int MAXN = 4e5 + 10;
const int MAXK = 30;
int ant[MAXN];
int dp[MAXN][MAXK];
int main() {
int n;
cin >> n;
vector<pair<lli, int>> xs{{0, 0}};
lli sum = 0;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
sum += x;
xs.emplace_back(sum, i);
}
for (int i = 1; i <= n; ++i)
ant[i] = -1;
sort(xs.begin(), xs.end());
for (int i = 1; i <= n; ++i)
if (xs[i].first == xs[i-1].first)
ant[xs[i].second] = xs[i-1].second;
for (int k = 0; k < MAXK; ++k)
dp[0][k] = -1;
for (int i = 1; i <= n; ++i) {
if (ant[i] < dp[i-1][0]) dp[i][0] = dp[i-1][0];
else dp[i][0] = ant[i];
for (int k = 1; k < MAXK; ++k)
if (dp[i][k-1] != -1) dp[i][k] = dp[dp[i][k-1]][k-1];
else dp[i][k] = -1;
}
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
int l, r;
cin >> l >> r;
int ans = 0;
for (int k = MAXK - 1; k >= 0; --k)
if (dp[r][k] >= l-1) {
r = dp[r][k];
ans += 1 << k;
}
cout << ans << "\n";
}
}
