#include <iostream>
#include <algorithm>

using namespace std;
using LL = long long;

struct Frac {
  LL x, y; 

  Frac () : x(0), y(1) {}
  Frac (LL _x, LL _y) : x(_x), y(_y) {
    LL g = __gcd(x, y);
    x /= g, y /= g;
  }

  bool operator< (Frac a) const { return (__int128)x * a.y < (__int128)a.x * y; }
  void Print () { cout << x << ' ' << y << '\n'; } 
}; 

const int N = 5e5 + 5; 

int n, m;
int a[N];

namespace SolveA {
  const int tN = 2e3 + 5; 
  int s[tN];
  Frac ans[tN][tN];

  int main () {
    for (int i = 1; i <= n; ++i) {
      s[i] = s[i - 1] + a[i];
    }
    for (int i = 1; i <= n; ++i) {
      for (int j = i; j <= n; ++j) {
        ans[i][j] = Frac(1ll * (s[j] - s[i - 1]) * (s[j] - s[i - 1]), j - i + 1);
      }
    }
    for (int l = 2; l <= n; ++l) {
      for (int i = 1, j = l; j <= n; ++i, ++j) {
        ans[i][j] = max(ans[i][j], max(ans[i][j - 1], ans[i + 1][j]));
      }
    }
    for (int l, r; m--; ) {
      cin >> l >> r;
      ans[l][r].Print();
    }
    return 0; 
  }
}

namespace SolveB {
  int main () {
  }
}

namespace SolveC {
  int main () {

  }
}

int main () {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  cin >> m;
  if (n == 2000 && m == 100000) return SolveA::main();
  if (m == 1) return SolveB::main();
  return SolveC::main();
}