#include<bits/stdc++.h>
#include<time.h>
using namespace std;

using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vvvvll = vector<vvvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
using vvvvb = vector<vvvb>;

bool DEB = 0;

bool isbool(ll N){
    if(N<=1)return 0;
    for(ll i=2;i*i<=N;i++){
        if(N%i==0)return 0;
    }
    return 1;
}

ll modPow(ll a,ll n,ll mod){
    a%=mod;
    if(n==0)return 1;
    if(n%2==1)return (modPow(a,n-1,mod)*a)%mod;
    ll res=modPow(a,n/2,mod);
    return (res*res)%mod;
}

int main() {

    ll N;
    cin>>N;
    vll L(N,0),R(N,0),A(N);
    rep(i,N)cin>>A[i];
    rep(i,N-1){
        L[i+1]=L[i];
        R[i+1]=R[i];
        if(A[i]<=A[i+1])L[i+1]++;
        if(A[i]>=A[i+1])R[i+1]++;
    }
    ll Q;
    cin>>Q;
    rep(q,Q){
        ll l,r;
        cin>>l>>r;
        if(l==r){
            cout<<1<<" "<<1<<endl;
            continue;
        }
        ll p=r-l;
        cout<<(L[r]-L[l]==p)<<" "<<(R[r]-R[l]==p)<<endl;
    }

}