#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;
using namespace std;


int main(int argc, char* argv[])
{
    int n;
    scanf("%d", &n);

    vector<int> cnt0(n), cnt1(n);
    ll prev;
    int i;
    for(i=0; i<n; i++) {
        ll tmp;
        scanf("%lld", &tmp);
        if(i>0) {
            cnt0[i]=cnt0[i-1]+(tmp<prev? 1:0);
            cnt1[i]=cnt1[i-1]+(tmp>prev? 1:0);
        }
        prev=tmp;
    }

    int Q;
    scanf("%d", &Q);
    for(i=0; i<Q; i++) {
        int l,r;
        scanf("%d%d", &l, &r);
        int ans0 = (cnt0[r]-cnt0[l]==0? 1: 0);
        int ans1 = (cnt1[r]-cnt1[l]==0? 1: 0);
        printf("%d %d\n", ans0, ans1);
    }

    return 0;
}