#include "bits/stdc++.h"

using namespace std;

//------------------------------- Libraries --------------------------------//

//------------------------------- Type Names -------------------------------//

using i64 = int_fast64_t;

using seika = string;
//akari : 1D, yukari : 2D, maki : 3D vector
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
//akane : ascending order, aoi : decending order
template <class kotonoha>
using akane = priority_queue<kotonoha, akari<kotonoha>, greater<kotonoha>>;
template <class kotonoha>
using aoi = priority_queue<kotonoha>;

//------------------------------- Dubug Functions ---------------------------//
inline void print()
{
    cout << endl;
}
template <typename First, typename... Rest>
void print(const First &first, const Rest &... rest)
{
    cout << first << ' ';
    print(rest...);
}
//------------------------------- Solver ------------------------------------//

void solve()
{
    int n;
    cin >> n;
    akari<i64> as(n), bs, cs(n);
    for (int i = 0; i < n; i++)
    {
        cin >> as[i];
    }
    bs = as;
    sort(bs.begin(), bs.end());
    for (int i = 0; i < n; i++)
    {
        cs[i] = distance(bs.begin(), lower_bound(bs.begin(), bs.end(), as[i]));
    }
    as = cs;
    bs.resize(n, 0);
    cs.resize(n, 0);
    for (int i = 0; i < n - 1; i++)
    {
        bs[i + 1] = bs[i] + (as[i] <= as[i + 1]);
        cs[i + 1] = cs[i] + (as[i] >= as[i + 1]);
    }
    int q;
    cin >> q;
    while (q--)
    {
        int l, r;
        cin >> l >> r;
        print(bs[r] - bs[l] == (r - l), cs[r] - cs[l] == (r - l));
    }
}

int main()
{
    solve();
    return 0;
}