ccf少羽机！

#include<bits/stdc++.h>
using namespace std;
#define int long long
int a[100005],s[100005];
signed main(){
    freopen("query.in","r",stdin);
    freopen("query.out","w",stdout);
    int n;cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=n;i++)s[i]=s[i-1]+a[i];
    int q;cin>>q;
    while(q--){
        int l,r;cin>>l>>r;
        int ans[100005]={0};
        memset(ans,0xc0,sizeof(ans));
        for(int i=1;i<=n;i++){
            for(int j=i+l-1;j<=min(n,i+r-1);j++){
                for(int k=i;k<=j;k++){
                    ans[k]=max(ans[k],s[j]-s[i-1]);
                }
            }
        }
        unsigned long long cnt=0;
        for(int i=1;i<=n;i++){
            cnt^=(i*(unsigned long long)ans[i]);
        }
        cout<<cnt<<endl;
    }
    return 0;
}