#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	vector<int> down(N), up(N);
	for (int i = 0; i < N;) {
		int r = i + 1;
		while (r < N && A[r - 1] <= A[r]) ++r;
		while (i < r) down[i] = r, ++i;
	}
	for (int i = 0; i < N;) {
		int r = i + 1;
		while (r < N && A[r - 1] >= A[r]) ++r;
		while (i < r) up[i] = r, ++i;
	}
	
	int Q;
	cin >> Q;
	while (Q--) {
		int l, r;
		scanf("%d %d", &l, &r);
		printf("%d %d\n", down[l] > r, up[l] > r);
	}
}