#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))

typedef long long ll;

int main(void){
	int n;
	cin >> n;

	ll a[n];
	ll asc[n];
	ll desc[n];
	REP(i, n){
		cin >> a[i];
	}

	REP(i, n){
		if(!i) asc[i] = 0;
		if(a[i] >= a[i-1]) asc[i] = asc[i-1]+1;
		else asc[i] = 0;
	}
	REP(i, n){
		if(!i) desc[i] = 0;
		if(a[i] <= a[i-1]) desc[i] = desc[i-1]+1;
		else desc[i] = 0;
	}

	int q;
	cin >> q;
	REP(i, q){
		int l, r;
		cin >> l >> r;
		if(asc[r] >= r-l) cout << 1 << ' ';
		else cout << 0 << ' ';
		if(desc[r] >= r-l) cout << 1 << endl;
		else cout << 0 << endl;
	}

	return 0;
}