#include <bits/stdc++.h>

#define int int64_t

const int kMaxN = 5e5 + 5;

struct Frac {
  int x, y; // x / y;

  Frac(int _x = 0, int _y = 1) {
    // int d = std::__gcd(_x, _y);
    // x = _x / d, y = _y / d;
    x = _x, y = _y;
  }

  friend bool operator <(Frac a, Frac b) { return a.x * b.y < a.y * b.x; }
  friend bool operator <=(Frac a, Frac b) { return a.x * b.y <= a.y * b.x; }
  friend bool operator >(Frac a, Frac b) { return a.x * b.y > a.y * b.x; }
  friend bool operator >=(Frac a, Frac b) { return a.x * b.y >= a.y * b.x; }
};

int n, m, q;
Frac mx;
int a[kMaxN], sum[kMaxN], ss[kMaxN], unq[kMaxN], pre[kMaxN][2];
std::vector<std::tuple<int, int, Frac>> vec;

struct BIT1 {
  int c[kMaxN];

  void upd(int x, int v) {
    for (; x <= m; x += x & -x) c[x] = std::max(c[x], v);
  }
  int qry(int x) {
    int ret = 0;
    for (; x; x -= x & -x) ret = std::max(ret, c[x]);
    return ret;
  }
} bit1;

struct BIT2 {
  int c[kMaxN];

  void upd(int x, int v) {
    for (; x; x -= x & -x) c[x] = std::max(c[x], v);
  }
  int qry(int x) {
    int ret = 0;
    for (; x <= m; x += x & -x) ret = std::max(ret, c[x]);
    return ret;
  }
} bit2;

void prework() {
  for (int i = 1; i <= n; ++i) {
    sum[i] = sum[i - 1] + a[i];
    unq[i] = sum[i];
  }
  std::sort(unq + 1, unq + 1 + n);
  m = std::unique(unq + 1, unq + 1 + n) - (unq + 1);
  for (int i = 1; i <= n; ++i) ss[i] = std::lower_bound(unq + 1, unq + 1 + m, sum[i]) - unq;
  pre[0][0] = pre[0][1] = -1;
  for (int i = 1; i <= n; ++i) {
    pre[i][0] = bit1.qry(ss[i]);
    pre[i][1] = bit2.qry(ss[i]);
    bit1.upd(ss[i], i), bit2.upd(ss[i], i);
  }

  for (int i = 1; i <= n; ++i) {
    // std::cerr << i << '\n';
    Frac now = {-1000000000, 1};
    for (int j = pre[i][0]; ~j; j = pre[j][0]) {
      Frac tmp = Frac((sum[i] - sum[j]) * (sum[i] - sum[j]), i - j);
      // if (tmp > now) vec.emplace_back(j + 1, i, tmp);
      mx = std::max(mx, tmp);
    }
    now = {-1000000000, 1};
    for (int j = pre[i][1]; ~j; j = pre[j][1]) {
      Frac tmp = Frac((sum[i] - sum[j]) * (sum[i] - sum[j]), i - j);
      // if (tmp > now) vec.emplace_back(j + 1, i, tmp);
      mx = std::max(mx, tmp);
    }
  }
}

void dickdreamer() {
  std::cin >> n;
  for (int i = 1; i <= n; ++i) std::cin >> a[i];
  prework();
  std::cin >> q;
  for (int i = 1; i <= q; ++i) {
    int ql, qr;
    std::cin >> ql >> qr;
    // Frac ans = {0, 1};
    // for (auto [l, r, w] : vec)
    //   if (l >= ql && r <= qr)
    //     ans = std::max(ans, w);
    // std::cout << ans.x << ' ' << ans.y << '\n';
    std::cout << mx.x << ' ' << mx.y << '\n';
  }
}

int32_t main() {
#ifdef ORZXKR
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
  int T = 1;
  // std::cin >> T;
  while (T--) dickdreamer();
  std::cerr << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
  return 0;
}