#include<bits/stdc++.h>
using namespace std;
const int N = (int)5e5+7;
int n, q, a[N];
int dp[5003][5003], mx[5003][5003];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
}
for(int i = 1; i <= n; ++i) {
for(int j = i; j <= n; ++j) {
mx[i][j] = max(mx[i][j-1], a[j]);
}
}
for(int len = 3; len <= n; ++len) {
for(int i = 1; i <= n-len+1; ++i) {
int j = i+len-1;
dp[i][j]=max(dp[i+1][j], dp[i][j-1]);
int cur = a[i]+a[j];
int m = (i+j)/2;
cur += mx[i+1][m];
dp[i][j] = max(dp[i][j], cur);
}
}
cin >> q;
while(q--) {
int l, r;
cin >> l >> r;
cout << dp[l][r] << "\n";
}
return 0;
}
