// #pragma GCC optimize ("Ofast")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
// #define int long long
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { T d2 = (a | b) & -(a | b); a /= d2; b /= d2; WHILE(b) { a = a % b; swap(a, b); } return a * d2; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
void _assert(bool statement) { if (statement) return; cerr << "\n>> Assertion failed!\n"; exit(0); }
void _assert(bool statement, const str &message) { if (statement) return; cerr << "\n>> Assertion failed: " << message << '\n'; exit(0); }
void _error(const str &message) { cerr << "\n>> Error: " << message << '\n'; exit(0); }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Tran The Bao - ghostwriter
Training for VOI23 gold medal
----------------------------------------------------------------
GOAT
----------------------------------------------------------------
*/
const int N = 5e5 + 5;
int n, q, a[N];
pi query[N];
void input(int test_id) {
cin >> n;
FOR(i, 1, n) cin >> a[i];
cin >> q;
FOR(i, 1, q) cin >> query[i].st >> query[i].nd;
}
namespace subtask12 {
const int N = 5005;
int d[N][N], maxx[N], pos[N], rs = 0;
int get(int l, int r) {
if (!pos[l]) {
maxx[l] = a[l];
pos[l] = l;
}
WHILE(pos[l] < r) {
++pos[l];
maxx[l] = max(maxx[l], a[pos[l]]);
}
return maxx[l];
}
void solve() {
FOR(len, 3, n)
FOR(l, 1, n - len + 1) {
int r = l + len - 1;
d[l][r] = max({d[l + 1][r], d[l][r - 1], a[l] + a[r] + get(l + 1, l + (r - l) / 2)});
}
FOR(i, 1, q) {
int l = query[i].st, r = query[i].nd;
cout << d[l][r] << '\n';
}
}
}
namespace subtask3 {
int maxx[N][18], LOG[N], rs = 0;
multiset<pi> s;
void build() {
FOR(i, 1, n) {
maxx[i][0] = a[i];
LOG[i] = log2(i);
}
FOR(j, 1, 17)
FOR(i, 1, n) {
if (i + (1 << j) - 1 > n) break;
maxx[i][j] = max(maxx[i][j - 1], maxx[i + (1 << (j - 1))][j - 1]);
}
}
int get(int l, int r) {
int l2 = LOG[r - l + 1];
return max(maxx[l][l2], maxx[r - (1 << l2) + 1][l2]);
}
int cal(int i) {
int rs = 0;
FOR(j, 1, i - 2) {
int mid = j + (i - j) / 2;
rs = max(rs, a[j] + a[i] + get(j + 1, mid));
}
FOR(j, i + 2, n) {
int mid = i + (j - i) / 2;
rs = max(rs, a[i] + a[j] + get(i + 1, mid));
}
FOR(j, 1, i - 1)
if (2 * i - j <= n)
rs = max(rs, a[j] + a[i] + get(2 * i - j, n));
return rs;
}
void solve() {
FOR(i, 1, n) {
s.ins({a[i], i});
if (sz(s) > 18) s.ers(s.bg());
}
build();
EACH(j, s) {
int i = j.nd;
rs = max(rs, cal(i));
}
cout << rs;
}
}
void solve(int test_id) {
if (n <= 5000) {
subtask12::solve();
return;
}
if (n <= 2e5 && q == 1 && query[1].st == 1 && query[1].nd == n) {
subtask3::solve();
return;
}
}
void reinit(int test_id) {
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
int test_num = 1;
// cin >> test_num; // comment if the problem does not requires multitest
FOR(i, 1, test_num) {
input(i); // input in noninteractive problems for case #i
solve(i); // main function to solve case #i
reinit(i); // reinit global data to default used in case #i
}
#ifdef LOCAL
cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms.\n";
#endif
return 0;
}
/*
5
5 2 1 5 3
1
1 5
----------------------------------------------------------------
From Benq:
stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/
