#include <bits/stdc++.h>
#define _for(i, a, b) for (int i = a; i <= b; ++i)
#define for_(i, a, b) for (int i = a; i >= b; --i)
#define far(i, vec) for (auto i : vec)
#define bdmd int mid = (l + r) >> 1
typedef long double ldb;
typedef long long ll;
typedef double db;
typedef std::pair <int, int> pii;
typedef std::pair <ll, ll> pll;
const int N = 1e5 + 10, P = 998244353;
namespace IO {
	int rnt () {
		int x = 0, w = 1; char c = getchar ();
		while (!isdigit (c)) { if (c == '-') w = -1; c = getchar (); }
		while (isdigit (c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar ();
		return x * w;
	}
}
namespace SEGMENT_TREE {
	class SegmentTree {
	private:
		int max[N << 2];

#define ls(p) (p << 1)
#define rs(p) (p << 1 | 1)
#define _ls(p) (p << 1), l, mid
#define _rs(p) (p << 1 | 1), mid + 1, r

		void PushUp (int p) { max[p] = std::max (max[ls (p)], max[rs (p)]); return; }
	public:
		void UpdP (int p, int l, int r, int x, int val) {
			max[p] = std::max (max[p], val);
			if (l != r) {
				bdmd;
				if (x <= mid) UpdP (_ls (p), x, val);
				else UpdP (_rs (p), x, val);
			}
			return;
		}
		int QueR (int p, int l, int r, int le, int ri) {
			if (ri < l || r < le) return 0;
			if (le <= l && r <= ri) return max[p];
			else {
				bdmd;
				int ansl = QueR (_ls (p), le, ri);
				int ansr = QueR (_rs (p), le, ri);
				return std::max (ansl, ansr);
			}
		}
	};
}
namespace SOLVE {
	using namespace IO;
	class Frac {
	public:
		int a, b;
		Frac () = default;
		void sim () {
			int g = std::__gcd (a, b);
			if (g) a /= g, b /= g;
			return;
		}
		Frac (int a, int b) : a (a), b (b) { sim (); }
		friend bool operator < (Frac a, Frac b) {
			return 1ll * a.a * b.b < 1ll * b.a * a.b;
		}
		ldb operator () () { return 1.0l * a / b; }
		ldb operator () () const { return 1.0l * a / b; }
	};
	int n, a[N], sum[N], q;
	SEGMENT_TREE::SegmentTree tr[10];
	void In () {
		n = rnt ();
		_for (i, 1, n) {
			a[i] = rnt ();
			sum[i] = sum[i - 1] + a[i];
		}
		return;
	}
	void Solve () {
		_for (k, 0, 9) _for (i, 1, n - k)
			tr[k].UpdP (1, 1, n, i, std::abs (sum[i + k] - sum[i - 1]));
		return;
	}
	void Out () {
		q = rnt ();
		_for (i, 1, q) {
			int l = rnt (), r = rnt ();
			Frac ans (0, 1);
			_for (k, 0, 9) {
				if (l + k > r) break;
				int x = tr[k].QueR (1, 1, n, l, r - k);
				ans = std::max (ans, Frac (x * x, k + 1));
			}
			printf ("%d %d\n", ans.a, ans.b);
		}
		return;
	}
}
int main () {
#ifndef ONLINE_JUDGE
	freopen ("data.in", "r", stdin);
	// freopen ("data.out", "w", stdout);
#endif
	SOLVE::In ();
	SOLVE::Solve ();
	SOLVE::Out ();
	return 0;
} /*

*/