#include <cstdio>
#include <cstring>
#include <cassert>
#include <string>
#include <deque>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
using ll=long long;
#define N 400005
#define ALL(x) x.begin(), x.end()
int n, q;
int P[N], J[N], D[N];
int qry(int l, int r)
{
int d = r;
while (P[r] >= l-1 && r) r = (J[r] < l-1 ? P[r] : J[r]);
return D[d] - D[r];
}
int main()
{
cin.tie(0)->sync_with_stdio(0);
cin >> n;
{
vector<int> a(n+1);
for (int i = 1; i <= n; ++i) cin >> a[i];
{
ll p = 0, u = 0;
map<ll, int> mp = {{0,0}};
J[0] = 0;
for (int i = 1; i <= n; ++i)
{
if (mp.count(p += a[i])) u = max(u, 1ll*mp[p]);
P[i] = u; D[i] = D[u] + 1;
if (u != J[u] && D[u] - D[J[u]] == D[J[u]] - D[J[J[u]]]) J[i] = J[J[u]];
else J[i] = u;
mp[p] = i;
}
}
}
cin >> q;
for (int qx, qy, i = 0; i < q; ++i)
{
cin >> qx >> qy;
cout << qry(qx, qy) << '\n';
}
return 0;
}
