#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long MOD = 1000000007;

typedef long long ll;

int
main(int argc, char *argv[])
{
  int n; cin >> n;
  vector<ll> a(n + 1);
  rep(i, n) cin >> a[i];
  vector<ll> d(n + 1);
  rep(i, n - 1) d[i] = a[i + 1] - a[i];
  vector<int> c1(n + 1, 0), c2(n + 1, 0);
  rep(i, n) {
    if (d[i] < 0) c1[i + 1] = c1[i] + 1;
    else c1[i + 1] = c1[i];
    if (d[i] > 0) c2[i + 1] = c2[i] + 1;
    else c2[i + 1] = c2[i];
  }
  int q, l, r;
  cin >> q;
  rep(i, q) {
    cin >> l >> r;
    if (c1[r] - c1[l] > 0) cout << 0 << " ";
    else cout << 1 << " ";
    if (c2[r] - c2[l] > 0) cout << 0 << endl;
    else cout << 1 << endl;
  }
  return 0;
}