#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
int n;
ll a[100005];
int q;
vector<int>up,dw;

int main(){
	cin >> n;
	rep(i,n) cin >> a[i];
	rep(i,n-1){
		if(a[i] < a[i+1]) up.pb(i);
		else if(a[i] > a[i+1]) dw.pb(i);
	}
	cin >> q;
	rep(i,q){
		int a,b; cin >> a >> b;
		if(a == b) cout << 1 << " " << 1 << endl;
		else{
			int x = POSL(dw,a); if(x != dw.size() && dw[x] < b) cout << 0; else cout << 1;
			x = POSL(up,a); if(x != up.size() && up[x] < b) cout << " " << 0 << endl; else cout << " " << 1 << endl;
		}
	}
}