#line 1 "e.cpp"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}


#line 4 "/Users/Shared/po167_library/ds/Sparse_table.hpp"
namespace po167{
template<class T, T(*op)(T, T)>
struct Sparse_table{
    int n;
    int depth;
    std::vector<std::vector<T>> val;
    void init(std::vector<T> &v){
        depth = 1;
        n = v.size();
        while ((1 << depth) <= n) depth++;
        val.resize(depth);
        val[0] = v;
        for (int i = 1; i < depth; i++){
            val[i].resize(n);
            for (int j = 0; j <= n - (1 << i); j++){
                val[i][j] = op(val[i - 1][j], val[i - 1][j + (1 << (i - 1))]);
            }
        }
    }
    Sparse_table(std::vector<T> v){
        init(v);
    }
    Sparse_table(){}
    // 0 <= l < r <= n
    // if l == r : assert
    T prod(int l, int r){
        assert(0 <= l && l < r && r <= n);
        int z=31-__builtin_clz(r-l);
        return op(val[z][l], val[z][r - (1 << z)]);
    }
};
}
#line 27 "e.cpp"

int op(int a, int b){
    return max(a, b);
}


void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<int> p(N);
    rep(i, 0, N) cin >> p[i], p[i]--;
    po167::Sparse_table<int, op> seg(p);
    int Q;
    cin >> Q;
    const int D = 20;
    vector<int> ans(N);
    vector<vector<pair<int, int>>> G(D);
    const bool local = false;
    vector<int> naive(N);
    rep(rp, 0, Q){
        int L, R;
        cin >> L >> R;
        L--;
        if (local){
            queue<int> q;
            rep(i, L, R) q.push(p[i]);
            while ((int)q.size() != 1){
                int a = q.front();
                q.pop();
                int b = q.front();
                q.pop();
                chmax(a, b);
                naive[a]++;
                q.push(a);
            }
        }
        int last = -1;
        rep(d, 0, D){
            // cout << "# " << d << " " << L << " " << R << endl;
            if (L == R) break;
            int tmp = (R - L) / (1 << (d + 1));
            tmp <<= (d + 1);
            G[d].push_back({L, L + tmp});
            if (L + tmp != R || last != -1){
                if (tmp == 0 && last == -1) break;
                // cout << d << " " << L << " " << tmp << " " << R << endl;
                bool fr = false;
                if (last == -1 || L + tmp == R) fr = true;
                //yneos(fr);
                if (L + tmp != R) chmax(last, seg.val[d][L + tmp]);
                if (fr) chmax(last, seg.val[d + 1][L]);
                ans[last]++;
                R = L + tmp;
                if (fr) L += (1 << (d + 1));
            }
        }
        // cout << rp + 1 << " OK" << endl;
    }
    rep(d, 0, D) if (!G[d].empty()){
        vector<int> val(1 << (d + 1));
        vector<int> A(N + 1);
        for (auto [a, b] : G[d]) A[a]++, A[b]--;
        rep(i, 0, N) {
            int a = (i & ((1 << (d + 1)) - 1));
            val[a] += A[i];
            // cout << a << " " << val[a] << " " << i << " " << A[i] << "\n";
            if (val[a]) ans[seg.val[d + 1][i]] += val[a];
            // vec_out(ans);
        }
    }
    for (auto x : ans) cout << x << "\n";
    if (local){
        vec_out(ans);
        vec_out(naive);
    }
}