#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fi first
#define se second
const int N = 1e6+5;
const int lg = 19;
const int block = 650;
int n,q,a[N];
//test
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
cin >> q;
while(q--){
int l,r;
cin >> l >> r;
vector<pii>cc;
for(int i = l; i <= r; i++) cc.push_back({a[i],i});
sort(cc.begin(),cc.end());
reverse(cc.begin(),cc.end());
vector<pii>dm;
for(int i = 0; i < min(lg,(int)cc.size()); i++) dm.push_back({cc[i].se,cc[i].fi});
sort(dm.begin(),dm.end());
int ans = 0;
for(int i = 0; i < dm.size(); i++){
for(int j = i+1; j < dm.size(); j++){
for(int k = j+1; k < dm.size(); k++){
if(2*dm[j].fi <= dm[i].fi+dm[k].fi) ans = max(ans,dm[i].se+dm[j].se+dm[k].se);
}
}
}
cout << ans << "\n";
}
}
