//#include <bits/stdc++.h>
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define fr first
#define sc second
#define ad push_back
using namespace std;
using ll = long long;
mt19937 rnd(348502);
const int N = 5005;
int a[N];
int dp[N][N];
int s[4 * N];
void build(int p, int lp, int rp)
{
if (lp == rp)
{
s[p] = a[lp];
return;
}
int m = (lp + rp) / 2;
build(p * 2, lp, m);
build(p * 2 + 1, m + 1, rp);
s[p] = max(s[p * 2], s[p * 2 + 1]);
}
int get(int p, int lp, int rp, int l, int r)
{
if (l > r)
return 0;
if (lp == l && rp == r)
return s[p];
int m = (lp + rp) / 2;
return max(get(p * 2, lp, m, l, min(r, m)), get(p * 2 + 1, m + 1, rp, max(m + 1, l), r));
}
void solve()
{
int n, i, j, x, y, m;
cin >> n;
for ( i = 1; i <= n; i++)
{
cin >> a[i];
}
build(1, 1, n);
for ( i = 1; i <= n; i++)
{
int ma = 0;
for (j = i + 2; j <= n; j++)
{
dp[i][j] = max(dp[i][j], get(1, 1, n, i + 1, (i + j) / 2) + a[i] + a[j]);
}
}
for ( i = 2; i <= n; i++)
{
for ( j = 1; j <= n; j++)
{
dp[j][j + i - 1] = max(dp[j][j + i - 1], max(dp[j + 1][j + i - 1], dp[j][j + i - 2]));
}
}
int q;
cin >> q;
for ( i = 0; i < q; i++)
{
cin >> x >> y;
cout << dp[x][y] << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll tt = 1;
//cin >> tt;
while (tt--) {
solve();
}
return 0;
}
