#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define int long long
const int N=1e5+3;
int sf[N];
int a[N];
int L[N];
int ps[N];
signed main(){
int n,q;
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
map<int,int>mp;
mp[0]=0;
for(int i=1;i<=n;i++){
ps[i]=ps[i-1]+a[i];
if(mp.find(ps[i])!=mp.end())L[i]= mp[ps[i]]+1;
mp[ps[i]]=i;
}
vector<pair<int,int>>vc;
for(int i=1;i<=n;i++){
if(L[i]>0){
vc.pb({L[i],i});
}
}
sort(vc.begin(),vc.end());
q=0;
for(int i=0;i<q;i++){
int l,r;
cin>>l>>r;
}
}
