#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::endl;
using std::cin;

template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

int main() {
	int n; scanf("%d", &n); std::vector<i64> a(n);
	for(int i = 0; i < n; i++) scanf("%lld", &a[i]);

	std::vector<int> A(n), B(n);
	for(int i = 0; i < n - 1; i++) A[i + 1] = (a[i] <= a[i + 1]);
	for(int i = 0; i < n - 1; i++) B[i + 1] = (a[i] >= a[i + 1]);
	for(int i = 0; i < n - 1; i++) A[i + 1] += A[i];
	for(int i = 0; i < n - 1; i++) B[i + 1] += B[i];
	
	int q; scanf("%d", &q);
	while(q--) {
		int l, r; scanf("%d%d", &l, &r);

		printf("%d %d\n", (A[r] - A[l] == r - l), (B[r] - B[l] == r - l));
	}
	return 0;
}