#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)5e3+10;
int a[mxN], dp[mxN][mxN];
int main(){
int n, q; cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
cin >> q;
for(int i = 1; i <= n; i++){
int k = i+1, mx = 0;
for(int j = i+2; j <= n; j++){
while(2*k<=i+j) mx = max(mx,a[k++]);
dp[i][j]=mx+a[i]+a[j];
}
}
for(int l = 1; l <= n; l++){
for(int i=1,j=i+l-1; j<= n; i++,j++){
dp[i][j+1] = max(dp[i][j+1],dp[i][j]);
dp[i-1][j] = max(dp[i-1][j],dp[i][j]);
}
}
while(q--){
int l, r; cin >> l>> r;
cout <<dp[l][r] << "\n";
}
}
