#include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int (i)=0;(i) < (N); (i)++)
#define all(V) V.begin(), V.end()
using i64 = int_fast64_t;
using P = pair<i64,i64>;

class UnionFind{
private:
    using uint = std::uint_fast64_t;
    std::vector<uint> par;
    std::vector<uint> sizes;

    uint find(uint x){
        if(x == par[x]) return x;
        return par[x] = find(par[x]);
    }
public:
    UnionFind() = delete;
    UnionFind(uint size) : par(size), sizes(size, 1){
        for(uint i = 0; i < size; ++i) par[i] = i;
    }

    bool unite(uint x, uint y){
        x = find(x);
        y = find(y);
        if(x == y) return false;
        
        if(sizes[x] < sizes[y]) std::swap(x, y);
        if(sizes[x] == sizes[y] && x > y) std::swap(x, y);
        sizes[x] += sizes[y];
        sizes[y] = 0;
        par[y] = x;
        return true;
    }
    bool isSame(uint x, uint y ){ return find(par[x]) == find(par[y]);}
    uint getSize(uint x){return find(sizes[par[x]]);}
}; 

int main(){
    int N;
    cin >> N;
    vector<i64> A(N);
    rep(i,N) cin >> A[i];
    UnionFind up(2*N), down(2*N);

    int left = 0, right = 0;
    i64 last = A[0];
    while(right < N){
        while(last <= A[right] && right < N) {
            up.unite(N+left, right);
            last = A[right];
            right++;
        }
        if(right < N) last = A[right];
        left = right;
    } 
    left = 0, right = 0;
    last = A[0];
    while(right < N){
        while(last >= A[right] && right < N) {
            down.unite(N+left, right);
            last = A[right];
            right++;
        }
        if(right < N) last = A[right];
        left = right;
    }

    int Q, l , r;
    cin >> Q;
    rep(i, Q){
        cin >> l >> r;
        cout << (up.isSame(l, r) ? 1 : 0) << " ";
        cout << (down.isSame(l, r) ? 1 : 0) << endl;
    }
     
}