#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
    sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1e9 + 7;
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> A(N);
    rep(i, 0, N) cin >> A[i];
    int Q;
    cin >> Q;
    vector<int> l(Q), r(Q);
    rep(i, 0, Q) cin >> l[i] >> r[i];

    using P = pair<int, int>;
    vector<P> X, Y;
    X.emplace_back(-2, -1);
    Y.emplace_back(-2, -1);
    int x = 0;
    int y = 0;
    rep(i, 1, N) {
        if (A[i - 1] > A[i]) {
            X.emplace_back(x, i);
            x = i;
        }
        if (A[i - 1] < A[i]) {
            Y.emplace_back(y, i);
            y = i;
        }
    }
    X.emplace_back(x, N);
    Y.emplace_back(y, N);
    dump(X, Y);

    rep(q, 0, Q) {
        auto p = upper_bound(all(X), P(l[q], INF));
        p--;
        dump(*p);
        cout << (p->first <= l[q] && r[q] < p->second) << " ";
        p = upper_bound(all(Y), P(l[q], INF));
        p--;
        cout << (p->first <= l[q] && r[q] < p->second) << endl;
    }

    return 0;
}