#include<iostream>
#include<vector>
#include<functional>
#include<climits>
using namespace std;

template<typename T>
struct Seg{
private:
    vector<T> node;
    int n;
    function<T(T,T)> f;
    T def;

public:
    Seg(int siz, T d, function<T(T,T)> f) : def(d), f(f) {
        n = 1;
        while(n < siz)  n *= 2;
        node.resize(2*n-1, def);
    }
    Seg(vector<T> v, T d, function<T(T,T)> f) : def(d), f(f){
        n = 1;
        while(n < v.size())  n *= 2;
        node.resize(2*n-1);
        for(int i = 0; i < v.size(); i++)   node[n-1+i] = v[i];
        for(int i = n-2; i >= 0; i--)   node[i] = f(node[2*i+1], node[2*i+2]);
    }

    void update(int x, T val){
        x += n-1;
        node[x] = val; /* ! */
        while(x){
            x = (x-1)/2;
            node[x] = f(node[2*x+1], node[2*x+2]);
        }
    }

    T query(int a, int b, int k=0, int l=0, int r=-1){
        if(r < 0)   r = n;
        if(b <= l || r <= a)    return def;
        if(a <= l && r <= b)    return node[k];
        T lx = query(a, b, 2*k+1, l, (l+r)/2);
        T rx = query(a, b, 2*k+2, (l+r)/2, r);
        return f(lx, rx);
    }
};

int main(){
    int n;
    cin >> n;
    long long a[n];
    for(int i = 0; i < n; i++)  cin >> a[i];
    vector<bool> asc(n, 0), dec(n, 0);
    for(int i = 1; i < n; i++){
        asc[i] = a[i-1] <= a[i];
        dec[i] = a[i-1] >= a[i];
    }

    function<bool(bool,bool)> f = [](bool a, bool b){return a&b;};
    Seg<bool> ge(asc, true, f);
    Seg<bool> le(dec, true, f);

    int q;
    cin >> q;
    while(q-- > 0){
        int l, r;
        cin >> l >> r;
        cout << ge.query(l+1,r+1) << " " << le.query(l+1,r+1) << endl;
    }
    return 0;
}