#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	vector<int> A(N);
	int res = 0;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}
	vector<int> X(N);
	vector<int> Y(N);

	for (int i = 0; i < N - 1; i++) {
		if (A[i] > A[i + 1]) {
			X[i + 1] = 1;
		}
		else if (A[i] < A[i + 1]) {
			Y[i + 1] = 1;
		}
	}
	for (int i = 1; i < N; i++) {
		X[i] += X[i - 1];
		Y[i] += Y[i - 1];
	}
	int Q;
	cin >> Q;
	int l, r;
	for (int i = 0; i < Q; i++) {
		cin >> l >> r;
		cout << ((X[r] - X[l]) > 0 ? 0 : 1) << " " << ((Y[r] - Y[l]) > 0 ? 0 : 1) << endl;
	}
}