#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;

int main(){
    int N; cin >> N;
    vector<ll> A(N);
    rep(i,N) cin >> A[i];
    vector<int> s(N);
    s[0] = 2;
    repr(i,1,N){
        if(A[i] == A[i-1]) s[i] = 2;
        else if(A[i] > A[i-1]) s[i] = 1;
        else s[i] = 0;
    }
    int Q; cin >> Q;
    while(Q--){
        int l,r; cin >> l >> r;
        if(l == r){
            cout << 1 << " " << 1 << endl;
        }
        else{
            if(s[l+1] == 0){
                if(s[r] == 1){
                    cout << 0 << " " << 0 << endl;
                }
                else cout << 0 << " " << 1 << endl;
            }
            else if(s[l+1] == 1){
                if(s[r] == 0){
                    cout << 0 << " " << 0 << endl;
                }
                else cout << 1 << " " << 0 << endl;
            }
            else{
                if(s[r] == 0) cout << 0 << " " << 1 << endl;
                else if(s[r] == 1) cout << 1 << " " << 0 << endl;
                else cout << 1 << " " << 1 << endl;
            }
        }
        
    }

}