#include <bits/stdc++.h>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)

using LL = long long;
const int N = 5e5 + 5;

int n, m, L[N], R[N];
LL a[N], s[N], mn[20][N], mx[20][N];
vector<int> q[N], P[N];
struct Node {
  LL x, y;
  Node(LL x = 0, LL y = 1) : x(x), y(y) {}
} c[N], ans[N];
void cmax(Node &a, const Node &b) {
  if (a.x * b.y < a.y * b.x) a = b;
}

LL up(LL x, LL y) {
  if (x % y == 0) return x / y;
  return x / y + 1;
}

#define lowbit(x) (x & -x)
void mdf(int x, Node v) {
  for (int i = x; i <= n + 1; i += lowbit(i)) cmax(c[i], v);
}
Node qry(int x) {
  Node res;
  for (int i = x; i > 0; i -= lowbit(i)) cmax(res, c[i]);
  return res;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  partial_sum(a, a + n + 1, s);
  for (int i = 0; i <= n; ++i) mn[0][i] = mx[0][i] = s[i];
  for (int j = 1; j < 20; ++j) {
    for (int i = 0; i + (1 << j) - 1 <= n; ++i) {
      mn[j][i] = min(mn[j - 1][i], mn[j - 1][i + (1 << j - 1)]);
      mx[j][i] = max(mx[j - 1][i], mx[j - 1][i + (1 << j - 1)]);
    }
  }
  cin >> m;
  for (int i = 1; i <= m; ++i) {
    cin >> L[i] >> R[i], --L[i];
    q[R[i]].push_back(i);
  }
  int cnt = 0;
  for (int l = 0; l < n; ++l) {
    LL x = 0, y = 1;
    for (int r = l + 1; r <= n; ++r) {
      auto check = [&](LL A, LL B) {
        return x * (r - l) < abs(A - B) * abs(A - B) * y;
      };
      if (r + 64 <= n && !check(mn[8][r], s[l]) && !check(mx[8][r], s[l])) {
        r += 63;
      } else {
        if (x * (r - l) < (s[r] - s[l]) * (s[r] - s[l]) * y) {
          x = (s[r] - s[l]) * (s[r] - s[l]);
          y = r - l;
          P[r].push_back(l);
          ++cnt;
        }
      }
    }
  }
  for (int r = 1; r <= n; ++r) {
    for (auto l : P[r]) {
      mdf(n - l + 1, Node((s[r] - s[l]) * (s[r] - s[l]), r - l));
    }
    for (auto id : q[r]) {
      ans[id] = qry(n - L[id] + 1);
    }
  }
  for (int i = 1; i <= m; ++i) {
    LL g = __gcd(ans[i].x, ans[i].y);
    cout << ans[i].x / g << " " << ans[i].y / g << "\n";
  }
  return 0;
}