#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    vector<ll> a(n);
    rep(i, n) cin >> a[i];
    vector<ll> fdp(n + 1, 0), gdp(n + 1, 0);
    rep(i, n) {
        if (i == 0) {
            fdp[i + 1] = 1;
            gdp[i + 1] = 1;
        }
        else {
            fdp[i + 1] = fdp[i] + ((a[i - 1] <= a[i]) ? 1 : 0);
            gdp[i + 1] = gdp[i] + ((a[i - 1] >= a[i]) ? 1 : 0);
        }
    }
    ll q;
    cin >> q;
    rep(i, q) {
        ll l, r;
        cin >> l >> r;
        ll fans = 0, gans = 0;
        if ((fdp[r + 1] - fdp[l]) == (r - l + 1)) fans++;
        if ((gdp[r + 1] - gdp[l]) == (r - l + 1)) gans++;
        printf("%lld %lld\n", fans, gans);
    }
    // rep(i, n + 1) printf("%lld%s", fdp[i], (i == n) ? "\n" : " ");
    // rep(i, n + 1) printf("%lld%s", gdp[i], (i == n) ? "\n" : " ");
    return 0;
}