#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <complex>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <random>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;

int main() {
    int n;
    cin >> n;
    vector<int> a(n), inc(n), dec(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    for (int i = 1; i < n; ++i) {
        inc[i] = (a[i] >= a[i - 1]) + inc[i - 1];
        dec[i] = (a[i] <= a[i - 1]) + dec[i - 1];
    }
    int q;
    cin >> q;
    while (q--) {
        int l, r;
        cin >> l >> r;
        cout << (inc[r] - inc[l] == r - l) << ' ';
        cout << (dec[r] - dec[l] == r - l) << '\n';
    }
    return 0;
}
// l     r
// 0, 1, 2
//   1  2