#include <cstdio>
#include <vector>
#include <algorithm>
#define lc (p<<1)
#define rc (p<<1|1)
using namespace std;
typedef long long ll;
int read(){
	char c=getchar();int x=0;bool f=0;
	while(c<48||c>57) f|=(c=='-'),c=getchar();
	do x=(x<<1)+(x<<3)+(c^48),c=getchar();
	while(c>=48&&c<=57);
	if(f) return -x;
	return x;
}
ll gcd(ll a,ll b){
	if(!b) return a;
	return gcd(b,a%b);
}
struct Frac{
	ll a;int b;
	Frac(ll A=0,int B=1):a(A),b(B){}
	friend bool operator<(const Frac x,const Frac y){
		return x.a*y.b<y.a*x.b;
	}
	void chmx(Frac v){if(*this<v) *this=v;}
	void show(){
		ll g=gcd(a,b);
		a/=g;b/=g;
		printf("%lld %d\n",a,b);
	}
};
const int N=500003,M=300003,T=500003;
Frac res[M],ans[N<<2];
int s[T],n,m;
Frac calc(int x,int y){return Frac((ll)(s[y]-s[x])*(s[y]-s[x]),x-y);}
int ql[M],qr[M];
vector<int> vec[N<<2],nd[N<<2],vv[N];
bool cmp(int x,int y){return ql[x]>ql[y];}
int stk[N],tp;
Frac lis[N];
void hang(int p,int l,int r,int x){
	if(ql[x]<=l&&r<=qr[x]){nd[p].emplace_back(x);return;}
	int mid=(l+r)>>1;
	if(qr[x]<=mid) return hang(lc,l,mid,x);
	if(ql[x]>mid) return hang(rc,mid+1,r,x);
	vec[p].emplace_back(x);
	hang(lc,l,mid,x);
	hang(rc,mid+1,r,x);
}
void solve(int p,int l,int r){
	if(l==r){ans[p]=Frac();return;}
	int mid=(l+r)>>1;
	solve(lc,l,mid);
	solve(rc,mid+1,r);
	ans[p]=max(ans[lc],ans[rc]);
	tp=0;
	for(int i=l;i<=mid;++i){
		while(tp&&s[stk[tp]]<=s[i]) --tp;
		stk[++tp]=i;
	}
	for(int i=1;i<=tp+1;++i) lis[i]=Frac();
	for(int x:vec[p]){
		if(qr[x]>r) vv[r].emplace_back(x);
		else vv[qr[x]].emplace_back(x);
	}
	for(int i=mid+1;i<=r;++i){
		int p=0,len=vv[i].size();
		Frac cur=Frac();
		for(int t=tp;t;--t){
			while(p<len&&ql[vv[i][p]]>stk[t]) res[vv[i][p++]].chmx(lis[t+1]);
			if(s[stk[t]]<=s[i]) continue;
			cur.chmx(calc(i,stk[t]));
			lis[t].chmx(cur);
		}
		while(p<len) res[vv[i][p++]].chmx(lis[1]);
		vv[i].clear();
	}
	ans[p].chmx(lis[1]);
	for(int x:nd[p]) res[x].chmx(ans[p]);
}
int seq[M];
int s1[T],t1;
int s2[T],t2;
const int B=1000;
int main(){
	freopen("value.in","r",stdin);
	freopen("value.out","w",stdout);
	n=read();
	for(int i=1;i<=n;++i) s[i]=s[i-1]+read();
	m=read();
	for(int i=1;i<=m;++i){ql[i]=read()-1;qr[i]=read();seq[i]=i;}
	if(m==1){
		Frac rr=Frac();
		for(int tl=ql[1],tr=ql[1]+B-1;tl<=qr[1];tl+=B,tr+=B){
			if(tr>qr[1]) tr=qr[1];
			t1=t2=0;
			for(int i=tl;i<=tr;++i){
				bool f1=1,f2=1;
				for(int j=1;j<=t1;++j)
					if(s[i]<s[s1[j]]) rr.chmx(calc(i,s1[j]));
					else{s1[t1=j]=i;f1=0;break;}
				if(f1) s1[++t1]=i;
				for(int j=1;j<=t2;++j)
					if(s[i]>s[s2[j]]) rr.chmx(calc(i,s2[j]));
					else{s2[t2=j]=i;f2=0;break;}
				if(f2) s2[++t2]=i;
			}
		}
		rr.show();
		return 0;
	}
	sort(seq+1,seq+m+1,cmp);
	for(int i=1;i<=m;++i) hang(1,0,n,seq[i]);
	solve(1,0,n);
	for(int i=1;i<=n;++i) s[i]=-s[i];
	solve(1,0,n);
	for(int i=1;i<=m;++i) res[i].show();
	return 0;
}