#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 {
static const int lg = 19;
vector<int> d;
vector<vector<int>> up;
BinaryJumps(int n) {
d.resize(n);
up.resize(lg, vector<int>(n, -1));
}
void add_leaf(int v, int p) {
d[v] = d[p] + 1;
up[0][v] = p;
for (int i = 1; i < lg; ++i) {
if (up[i - 1][v] != -1) {
up[i][v] = up[i - 1][up[i - 1][v]];
}
}
}
int la(int v, const function<bool(int)> &f) {
for (int i = lg - 1; i >= 0; --i) {
if (up[i][v] == -1) {
continue;
}
if (f(up[i][v])) {
v = up[i][v];
}
}
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> suf(n + 1, n);
{
map<ll, int> last;
last[pref[n]] = n;
for (int i = n - 1; i >= 0; --i) {
int r = n;
if (last.find(pref[i]) != last.end()) {
r = last[pref[i]] - 1;
}
suf[i] = min(suf[i + 1], r);
last[pref[i]] = 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;
}
