#include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") #define int long long #define pii pair<int,int> #define vi vector<int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() #define big(x) ((int)(x.size())) using namespace std; const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e18; const int N = 1e5+1; void solve() { int n; cin >> n; vi a(n+1); for (int i=1;i<=n;i++) cin >> a[i]; int up[n+2][20]; int sm = 0; map<int,int> sms; up[n+1][0] = n+1; sms[0] = n+1; for (int i = n;i>=1;i--) { up[i][0] = up[i+1][0]; sm+=a[i]; if (sms.count(sm)) up[i][0] = min(up[i][0],sms[sm]-1); sms[sm] = i; } for (int i=1;i<20;i++) { for (int j = 1;j<=n+1;j++) { if (up[j][i-1] != n+1) up[j][i] = up[up[j][i-1]+1][i-1]; else up[j][i] = up[j][i-1]; } } int q; cin >> q; while (q--) { int l,r; cin >> l >> r; int ans = 0; int cur = l; for (int i = 19;i>=0;i--) { if (cur <= r && up[cur][i] <= r) { cur = up[cur][i]+1,ans+=(1<<i); } } cout << ans << '\n'; } } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int t = 1; //cin >> t; while (t --> 0) solve(); }