#include <iostream>
#include <set>
using namespace std;
const int step = 630;
long long N, Q, hol, o, tart, a, b;
int t[400001];
int apa[400001];
int tav[400001];
int f[400001];
set<pair<long long, int>> szet;
set<int> veg;
int solve(int x)
{
int y = a;
if (t[x] < y)
{
return 0;
}
int ret = 0;
while (tav[x] >= step && y <= t[f[x]])
{
ret += step;
x = f[x];
}
while (x != 0 && y <= t[apa[x]])
{
ret++;
x = apa[x];
}
return ret + 1;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> N;
for (int i = 1; i <= N; i++)
{
cin >> t[i];
}
szet.insert({0, -0});
veg.insert(0);
int last = 0;
for (int i = 1; i <= N; i++)
{
o += (long long)t[i];
auto it = szet.lower_bound({o, -2 * N});
if (it != szet.end() && (*it).first == o && -(*it).second + 1 > last)
{
last = -(*it).second + 1;
auto it2 = veg.lower_bound(last);
it2--;
apa[i] = (*it2);
tav[i] = tav[apa[i]] + 1;
if (tav[i] >= step)
{
f[i] = i;
for (int cnt = 0; cnt < step; cnt++)
f[i] = apa[f[i]];
}
t[i] = last;
veg.insert(i);
}
szet.insert({o, -i});
}
cin >> Q;
for (int i = 0; i < Q; i++)
{
cin >> a >> b;
auto it = veg.lower_bound(b + 1);
it--;
cout << solve((*it)) << '\n';
}
return 0;
}
