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

template<typename T>
struct Segtree {
    int n;
    T e;
    vector<T> dat;
    typedef function<T(T a, T b)> Func;
    Func f;

    Segtree(){}
    Segtree(int n_input, Func f_input, T e_input){
        initialize(n_input, f_input, e_input);
    }
    void initialize(int n_input, Func f_input, T e_input){
        f = f_input;
        e = e_input;
        n = 1;
        while(n < n_input) n <<= 1;
        dat.resize(2*n-1, e);
    }

    void update(int k, T a){
        k += n - 1;
        dat[k] = a;
        while(k > 0){
            k = (k - 1)/2;
            dat[k] = f(dat[2*k+1], dat[2*k+2]);
        }
    }

    T get(int k){
        return dat[k+n-1];
    }

    T between(int a, int b){
        return query(a, b+1, 0, 0, n);
    }

    T query(int a, int b, int k, int l, int r){
        if(r<=a || b<=l) return e;
        if(a<=l && r<=b) return dat[k];
        T vl = query(a, b, 2*k+1, l, (l+r)/2);
        T vr = query(a, b, 2*k+2, (l+r)/2, r);
        return f(vl, vr);
    }
};

int main(){
    int N;
    int64_t A[100000];
    cin >> N;
    for(int i=0; i<N; i++) cin >> A[i];
    Segtree<int64_t> stmax(N-1, [](int64_t a, int64_t b){ return max(a, b); }, -2e18);
    Segtree<int64_t> stmin(N-1, [](int64_t a, int64_t b){ return min(a, b); }, 2e18);
    for(int i=0; i<N-1; i++){
        int64_t d = A[i+1] - A[i];
        stmax.update(i, d);
        stmin.update(i, d);
    }
    int Q;
    cin >> Q;
    while(Q--){
        int l, r;
        cin >> l >> r;
        r--;
        int ans1 = (stmin.between(l, r) >= 0);
        int ans2 = (stmax.between(l, r) <= 0);
        cout << ans1 << " " << ans2 << endl;
    }
}