#include<bits/stdc++.h>
#define il inline
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define pii pair<int, int>
#define fr first
#define sc second
#define ll long long
#define mset(f, z) memset(f, z, sizeof(f))
#define mcpy(f, g) memcpy(f, g, sizeof(g))
using namespace std;
template<typename T=ll>
il T rd(){
	T s=0; bool f=1; char c=getchar();
	while(!isdigit(c)) f^=(c=='-'), c=getchar();
	while(isdigit(c)) s=s*10+c-'0', c=getchar();
	return f? s:-s;
}
template<typename T> il void ckmx(T &x, T y){if(x<y) x=y;}
template<typename T> il void ckmn(T &x, T y){if(y<x) x=y;}
char _begin;
#define int ll

const int N=5e5+5, M=705;

int n, m, a[N];

bool operator <(const pii &x, const pii &y){
	return x.fr*y.sc<y.fr*x.sc;
}

vector<pii> q[N];

int B, bid, bel[N], lp[N], rp[N];
pii mx[N], bmx[M], ans[N];

char _end;
signed main(int argc, char *argv[]){
	debug("%lfMB\n", (&_end-&_begin)/1024./1024.);

	n=rd();
	for(int i=1; i<=n; i++) a[i]=rd();
	m=rd();
	for(int i=1; i<=m; i++){
		int l=rd(), r=rd();
		q[r].push_back({l, i});
		ans[i]={0, 1};
	}
	B=sqrt(n);
	for(int i=1; i<=n; i++){
		bid=bel[i]=(i-1)/B+1;
		mx[i]={0, 1};
		if(!lp[bid]) lp[bid]=i, bmx[bid]={0, 1};
		rp[bid]=i;
	}
	//sweep
	for(int i=1; i<=n; i++){
		int sum=0;
		for(int j=i; j>0 && i-j+1<=2000; j--){
			sum+=a[j];
			pii cur={sum*sum, i-j+1};
			ckmx(mx[j], cur);
			ckmx(bmx[bel[j]], cur);
		}
		for(auto [l, id]:q[i]){
			for(int j=bel[l]+1; j<bel[i]; j++) ckmx(ans[id], bmx[j]);
			for(int j=lp[bel[l]]; j<=min(rp[bel[l]], i); j++) ckmx(ans[id], mx[j]);
			if(bel[l]!=bel[i]) for(int j=lp[bel[i]]; j<=i; j++) ckmx(ans[id], mx[j]);
		}
	}
	for(int i=1; i<=m; i++){
		auto [a, b]=ans[i];
		if(!a) puts("0 1");
		else{
			int gc=__gcd(a, b);
			printf("%lld %lld\n", a/gc, b/gc);
		}
	}
	return 0;
}