#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll infll = 1e18;
template<typename T>
istream &operator>>(istream &is, vector<T> &a) {
for (auto &i : a) {
is >> i;
}
return is;
}
struct BinaryJumps {
vector<int> d;
vector<int> par;
vector<int> jump;
BinaryJumps(int n) {
d.resize(n);
par.resize(n, -1);
jump.resize(n, -1);
}
void add_leaf(int v, int p) {
d[v] = d[p] + 1;
par[v] = p;
if (jump[p] != -1 && jump[jump[p]] != -1 && d[p] - d[jump[p]] == d[jump[p]] - d[jump[jump[p]]]) {
jump[v] = jump[jump[p]];
} else {
jump[v] = p;
}
}
int la(int v, const function<bool(int)> &f) {
while (true) {
if (jump[v] != -1 && f(jump[v])) {
v = jump[v];
} else if (par[v] != -1 && f(par[v])) {
v = par[v];
} else {
break;
}
}
return v;
}
};
int32_t main() {
#ifdef LOCAL
freopen("/tmp/input.txt", "r", stdin);
#else
ios::sync_with_stdio(false);
cin.tie(nullptr);
#endif
int n;
cin >> n;
vector<int> a(n);
cin >> a;
vector<ll> pref(n + 1);
for (int i = 1; i <= n; ++i) {
pref[i] = pref[i - 1] + a[i - 1];
}
vector<int> R(n);
{
map<ll, int> last;
last[pref[n]] = n;
for (int i = n - 1; i >= 0; --i) {
if (last.find(pref[i]) != last.end()) {
R[i] = last[pref[i]] - 1;
} else {
R[i] = n;
}
last[pref[i]] = i;
}
}
vector<int> suf(n + 1, n);
for (int i = n - 1; i >= 0; --i) {
suf[i] = min(suf[i + 1], R[i]);
}
BinaryJumps tr(n + 1);
for (int i = n - 1; i >= 0; --i) {
if (suf[i] + 1 <= n) {
tr.add_leaf(i, suf[i] + 1);
}
}
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r;
--l;
int v = tr.la(l, [&](int v) {
return v <= r;
});
cout << tr.d[l] - tr.d[v] << "\n";
}
return 0;
}
