#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
using namespace std;

typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const int INF = 1e9;
const long long INFL = 1LL<<60;

int main()
{
  int n;
  cin >> n;
  vector<ll> a(n);
  rep(i, n) {
    cin >> a[i];
  }
  vector<ll> inc(n);
  vector<ll> dec(n);
  int lastInc = 0;
  int lastDec = 0;
  rep(i, n-1) {
    if (a[i] > a[i+1]) {
      for (int j = lastInc; j <= i; j++) {
        inc[j] = i;
        lastInc = i+1;
      }
    }
    if (a[i] < a[i+1]) {
      for (int j = lastDec; j<= i; j++) {
        dec[j] = i;
        lastDec = i+1;
      }
    }
  }
  for (int j = lastInc; j < n; j++) {
    inc[j] = n-1;
  }
  for (int j = lastDec; j < n; j++) {
    dec[j] = n-1;
  }

  int q;
  cin >> q;
  rep(i, q) {
    int l, r;
    cin >> l >> r;
    if (r <= inc[l]) {
      cout << 1;
    } else {
      cout << 0;
    }
    cout << " ";
    if (r <= dec[l]) {
      cout << 1;
    } else {
      cout << 0;
    }
    cout << endl;
  }
  return 0;
}