#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

int main(){
    int N; cin >> N;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];
    vector<int> sum1(N+1);
    vector<int> sum2(N+1);
    repr(i,1,N){
        if(A[i] >= A[i-1]) sum1[i+1] = sum1[i] + 1;
        if(A[i] <= A[i-1]) sum2[i+1] = sum2[i] + 1;
    }
    int Q; cin >> Q;
    while(Q--){
        int l,r; cin >> l >> r;
        Pi ans;
        if(sum1[r+1]-sum1[l+1] == r-l) ans.first = 1;
        else ans.first = 0;
        if(sum2[r+1]-sum2[l+1] == r-l) ans.second = 1;
        else ans.second = 0;
        cout << ans.first << " " << ans.second << endl;
    }

}