# include <bits/stdc++.h>
# define ll long long

using namespace std;

const int N = 5e5 + 5, K = 300;

struct Fr {
ll a, b;
}st[20][N];

ll s[N], sum[N];
int n, m;

bool operator <(Fr x, Fr y) {
  return x.a * y.b < y.a * x.b;
}

Fr clc(int l, int r) {
  // cerr << l << ' ' << r << ' ' << (sum[r] - sum[l - 1]) * (sum[r] - sum[l - 1]) << '\n';
  return (Fr){(sum[r] - sum[l - 1]) * (sum[r] - sum[l - 1]), r - l + 1};
}

void init() {
  for (int i = 1; i <= n - K + 1; i++) {
    Fr mx = {0, 1};
    for (int j = i; j < i + K; j++) {
      mx = max(mx, clc(i, j));
    }
    st[0][i] = mx;
  }
  for (int j = 1; j < 20; j++) {
    for (int i = 1; i + (1 << j) - 1 <= n; i++) {
      st[j][i] = max(st[j - 1][i], st[j - 1][i + (1 << j >> 1)]);
    }
  }
}

Fr query(int l, int r) {
  int k = 31 - __builtin_clz(r - l + 1);
  return max(st[k][l], st[k][r - (1 << k) + 1]);
}

Fr pr(int l, int r) {
  Fr res = {0, 1};
  if (r - l + 1 >= K) {
    res = query(l, r - K + 1);
  }
  for (int i = max(l, r - K + 2); i <= r; i++) {
    for (int j = i; j <= r; j++) {
      res = max(res, clc(i, j));
    }
  }
  ll g = __gcd(res.a, res.b);
  res.a /= g, res.b /= g;
  return res;
}

int main() {
# ifndef ONLINE_JUDGE
  freopen("in.txt", "r", stdin);
# endif
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> s[i], sum[i] = sum[i - 1] + s[i];
  }
  init();
  cin >> m;
  while (m--) {
    int l, r; cin >> l >> r;
    Fr ans = pr(l, r);
    cout << ans.a << ' ' << ans.b << '\n';
  }
  return 0;
}