#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
constexpr ll inf = 1ll << 62ll;
mt19937 mt(time(0));
ll _ = 0;
void solve() {
ll n; cin >> n;
vector<ll> a(n);
for (auto &e : a) cin >> e;
ll q; cin >> q;
while (q--) {
ll l, r; cin >> l >> r; l--; r--;
ll res = 0;
for (ll i = l; i <= r; i++) {
for (ll j = i+1; j <= r; j++) {
for (ll k = j+1; k <= r; k++) {
if ((j-i) > (k-j)) continue;
res = max(res, a[i] + a[j] + a[k]);
}
}
}
cout << res << '\n';
}
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
solve();
}
