// #pragma GCC target ("avx2")
// #pragma GCC optimize ("O3")
// #pragma GCC optimize ("unroll-loops")
// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
#include <numeric>
#include <stack>
using namespace std;
// #define int long long
#define endl "\n"
void solve() {
int n; cin >> n;
map<int , int> c;
int a[n + 2], p[n + 2] = {};
int sp[n + 2][3] = {{}};
int l = 0;
// for (int i = 0; i <= n; i++){
// for (int j = 0; j < 18; j++) sp[i][j] = -1;
// }
c[0] = 1;
for (int i = 2; i <= n + 1; i++){
cin >> a[i];
p[i] = p[i - 1] + a[i];
if (p[i] == p[c[p[i]]]){
l = max(l, c[p[i]]);
}
sp[i][0] = l;
c[p[i]] = i;
// cout << l << ' ';
}
// cout << endl;
for (int j = 1; j <= 2; j++){
for (int i = 2; i <= n + 1; i++){
int cur = i;
for (int k = 1; k <= 74; k++){
cur = sp[cur][j - 1];
}
sp[i][j] = cur;
}
}
int q; cin >> q;
for (int i = 1; i <= q; i++){
int l, r; cin >> l >> r;
l++, r++;
int ans = 0;
int j = 2;
while (1){
// cout << l - 1 << ' ' << sp[r][j] << ' ' << j << endl;
if (sp[r][j] >= l - 1){
ans += pow(74, j);
r = sp[r][j];
// cout << r << ' ' << j << endl;
}
else j--;
if (j < 0) break;
}
cout << ans << endl;
// cout << endl;
}
return;
}
signed main() {
// freopen("", "r", stdin);
// freopen("", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cout << setprecision(9);
srand(time(0));
int tc = 1;
// cin >> tc;
while (tc--) {
solve();
}
return 0;
}
