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

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A,size_t N,typename T>void Fill(A(&array)[N],const T &val){fill((T*)array, (T*)(array+N), val);}
const int inf = 0x3fffffff; const ll INF = 0x3fffffffffffffff;
//template end



int main(){
    int n; scanf("%d",&n);
    vector<int> a(n);
    rep(i,0,n)scanf("%d",&a[i]);
    int rui[2][100010]={};
    rep(i,0,n-1)rui[0][i+1]=(a[i]<=a[i+1]),rui[1][i+1]=(a[i]>=a[i+1]);
    rep(i,0,n-1)rui[0][i+1]+=rui[0][i],rui[1][i+1]+=rui[1][i];
    int q; scanf("%d",&q);
    rep(i,0,q){
        int l,r; scanf("%d%d",&l,&r);
        printf("%d %d\n",(rui[0][r]-rui[0][l]==r-l),(rui[1][r]-rui[1][l]==r-l));
    }
    return 0;
}