#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <ctime>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define fs first
#define sc second
#define INF 1000000000
#define MOD 1000000007
#define EPS 0.00000001



int main() {
    int N; cin >> N;
    vector<ll> A(N);
    for(ll &a:A){
        cin >> a;
    }
    
    vector<int> inc(N);
    vector<int> dec(N);
    
    
    int s = 0;
    int e = 1;
    for(int i=0; i<N-1; i++){
        if(A[i+1] >= A[i]) e++;
        else {
            for(int j=s; j<e; j++){
                inc[j] = e-1;
            }
            e = i+2;
            s = i+1;
        }
    }
    for(int j=s; j<e; j++){
        inc[j] = e-1;
    }
    
    
    s = 0;
    e = 1;
    for(int i=0; i<N-1; i++){
        if(A[i+1] <= A[i]) e++;
        else {
            for(int j=s; j<e; j++){
                dec[j] = e-1;
            }
            e = i+2;
            s = i+1;
        }
    }
    for(int j=s; j<e; j++){
        dec[j] = e-1;
    }
    
    
    int Q; cin >> Q;
    vector<int> L(Q), R(Q);
    for(int i=0; i<Q; i++){
        cin >> L[i] >> R[i];
    }
    
    for(int i=0; i<Q; i++){
        if(inc[L[i]] >= R[i]) cout << 1 << " ";
        else cout << 0 << " ";
        if(dec[L[i]] >= R[i]) cout << 1 << endl;
        else cout << 0 << endl;
    }
    
    
    
    return 0;
}