#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5+5;
int a[N], pre[N], same[N], nxt[N];
array<int, 2> up[N][20];
// for(int i=1; i<=n; i++)
void solve(){
int n; cin >> n;
for(int i=1; i<=n; i++) cin >> a[i], pre[i] = pre[i-1] + a[i];
n++;
for(int i=n; i>=1; i--) pre[i] = pre[i-1];
map<int, int> last;
for(int i=1; i<=n; i++) {
same[i] = last[pre[i]];
last[pre[i]] = i;
}
// for(int i=1; i<=n; i++){
// nxt[i] = n+1;
// for(int j=i+1; j<=n; j++){
// if(same[j] >= i) {nxt[i] = j; break;}
// }
// }
for (int i = 1; i <= n; i++) {
nxt[i] = n + 1;
for (int j = i + 1; j <= n; j++) {
bool ok = false;
// check if there exists k in [i..j-1]
// with p[k] == p[j]
for (int k = i; k < j; k++) {
if (pre[k] == pre[j]) {
ok = true;
break;
}
}
if (ok) {
nxt[i] = j;
break;
}
}
}
for(int i=n; i>=1; i--){
up[i][0][0] = 1;
up[i][0][1] = nxt[i];
for(int j=1; j<20; j++){
if(up[i][j-1][1] > n){
up[i][j] = {0, n+1};
continue;
}
up[i][j][0] = up[i][j-1][0] + up[up[i][j-1][1]][j-1][0];
up[i][j][1] = up[up[i][j-1][1]][j-1][1];
if(i == 1 and j == 3){
// cout << up[i][j][1] << endl;
}
}
}
int q; cin >> q;
while(q--){
int l, r; cin >> l >> r; r++;
int ans = 0;
for(int b=19; b>=0; b--){
if(l > r) break;
if(up[l][b][1] > r) continue;
// cout << l << " ";
ans += up[l][b][0];
l = up[l][b][1] + 1;
}
cout << ans << '\n';
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
