#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define rep2r(i, l, r) for (int i = (r) - 1; i >= (l); i--)
#define range(a) a.begin(), a.end()

using namespace std;
using ll = long long;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  int N; cin >> N;
  vector<ll> a(N);
  rep(i, N) cin >> a[i];
  vector<int> le(N);
  vector<int> ge(N);
  rep(i, N - 1) {
    le[i + 1] = le[i] + (a[i] <= a[i + 1]);
  }
  rep(i, N - 1) {
    ge[i + 1] = ge[i] + (a[i] >= a[i + 1]);
  }
  int q; cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    int ans0 = (le[r] - le[l]) == (r - l);
    int ans1 = (ge[r] - ge[l]) == (r - l);
    cout << ans0 << ' ' << ans1 << endl;
  }
}