/*************************************
* author: marvinthang *
* created: 11.03.2024 10:42:17 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// end of template
const int MAX = 4e5 + 1;
int left[MAX], right[MAX], nxt[MAX], qr[MAX], pos[MAX], res[MAX], list_vertices[MAX], clv, prv[MAX];
void process(void) {
int n; cin >> n;
REP(i, n) cin >> left[i];
map <long long, int> last;
nxt[n] = n + 1;
last[0] = n;
long long cur = 0;
REPD(i, n) {
cur += left[i];
if (last.count(cur)) nxt[i] = last[cur];
else nxt[i] = n + 1;
last[cur] = i;
}
last.clear();
memset(left, 0, (n + 1) * sizeof(int));
memset(right, -1, (n + 1) * sizeof(int));
REPD(i, n) {
nxt[i] = min(nxt[i], nxt[i + 1]);
if (nxt[i] == n + 1) continue;
left[nxt[i]] = i;
if (right[nxt[i]] == -1) right[nxt[i]] = i;
}
int q, l; cin >> q;
memset(pos, -1, (n + 1) * sizeof(int));
REP(i, q) {
cin >> l >> qr[i]; --l;
prv[i] = pos[l];
pos[l] = i;
}
function<void(int)> dfs = [&] (int u) {
list_vertices[clv++] = u;
for (int i = pos[u]; i >= 0; i = prv[i]) {
auto p = partition_point(list_vertices, list_vertices + clv, [&] (int x) { return x >= qr[i]; });
res[i] = list_vertices + clv - p - 1 + (nxt[*p] == qr[i]);
}
FORE(v, left[u], right[u]) dfs(v);
--clv;
};
REP(i, n + 1) if (nxt[i] == n + 1) dfs(i);
REP(i, q) cout << res[i] << '\n';
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("sumzero");
// int t; cin >> t; while (t--)
process();
// cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
