#include "iostream"
#include "algorithm"
#include "vector"
#include "set"
#include "map"
#include "cstring"
#include "string"
#include "vector"
#include "cassert"
#include "queue"
#include "cstdio"
#include "cstdlib"

using namespace std;

typedef long long ll;
typedef pair < int, int > ii;

const int N = 1e6 + 5;

int n, m, cnt, tick;
int a[N], gobig[N], gosmall[N], h[N], st[N], nd[N], root[N];
vector < int > g[N];
vector < ii > qu[N];
int fen[N], ans[N];

void dfs(int p, int x) {
    st[x] = ++tick;
    h[x] = 1;
    for(auto u : g[x])
        if(u != p)
            dfs(x, u);
    nd[x] = tick;
}

inline void up(int x, int y, int k) {
    //printf("x = %d y = %d k = %d\n", x, y, k);
    for(; y; y -= y & -y)
        fen[y] += k;
    for(x--; x; x -= x & -x)
        fen[x] -= k;
}

inline int get(int x) {
    int res = 0;
    for(; x < N; x += x & -x)
        res += fen[x];
    return res;
}

void dfs2(int p, int x) {
    int y = x > n ? x - n : x + n;
    //printf("x = %d y = %d\n", x, y);
    up(st[x], nd[x], +1);
    up(st[y], nd[y], +1);
    for(auto u : qu[x]) {
        //printf("id = %d res = %d\n", u.second, get(st[u.first]));
        ans[u.second] = get(st[u.first]);
    }
    h[x] = 1;
    for(auto u : g[x])
        if(u != p)
            dfs2(x, u);
    //printf("del x = %d y = %d\n", x, y);
    up(st[x], nd[x], -1);
    up(st[y], nd[y], -1);
}

int f(int x) {
    if(x != root[x])
        return root[x] = f(root[x]);
    return x;
}

int main() {
    
    scanf("%d", &n);
    
    for(int i = 1; i <= n; i++) {
        scanf("%d", a + i);
    }
    
    vector < ii > v;
    
    for(int i = n; i >= 1; i--) {
        while(!v.empty() and v.back().first <= a[i])
            v.pop_back();
        if(v.size()) {
            gobig[i] = v.back().second;
        }
        v.push_back(ii(a[i], i));
    }
    
    v.clear();
    
    for(int i = n; i >= 1; i--) {
        while(!v.empty() and v.back().first >= a[i])
            v.pop_back();
        if(v.size()) {
            gosmall[i] = v.back().second;
        }
        v.push_back(ii(a[i], i));
    }
    
    for(int i = 1; i <= n + n; i++)
        root[i] = i;
    
    for(int i = 1; i <= n; i++) {
        if(gosmall[i]) {
            g[gosmall[i] + n].push_back(i);
            root[f(i)] = f(gosmall[i] + n);
        }
        if(gobig[i]) {
            g[gobig[i]].push_back(i + n);
            root[f(i + n)] = f(gobig[i]);
        }
    }
    
    for(int i = 1; i <= n + n; i++) {
        if(!h[f(i)]) {
            cnt++;
            dfs(0, f(i));
        }
    }
    
    scanf("%d", &m);
    
    for(int i = 1; i <= m; i++) {
        int x, y;
        scanf("%d %d", &x, &y);
        qu[x].push_back(ii(y, i));
    }
    
    memset(h, 0, sizeof(h));
    
    for(int i = 1; i <= n + n; i++) {
        if(!h[f(i)]) {
            dfs2(0, f(i));
        }
    }
    
    for(int i = 1; i <= m; i++)
        printf("%d\n", (bool) ans[i]);
    
    return 0;
    
}