#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e18)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
#define YesNo(a) cout<<((a)?"Yes":"No")<<endl
#define YESNO(a) cout<<((a)?"YES":"NO")<<endl

int main(){

	int N,Q;
	cin >> N;
	vector<int> A(N),f(N,0),g(N,0);
	FOR(i,0,N)cin >> A[i];

	FOR(i,1,N){
		f[i] = f[i-1];
		g[i] = g[i-1];
		if(A[i-1]<=A[i])f[i]++;
		if(A[i-1]>=A[i])g[i]++;
	}
	cin >> Q;
	FOR(i,0,Q){
		int l,r;
		cin >> l >> r;
		cout << int((f[r]-f[l])==(r-l)) << " " << int((g[r]-g[l])==(r-l)) << endl;
	}

}