#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI p(n);
  rep(i, n) cin >> p[i], p[i]--;
  struct Q {
    int l, r, last;
  };
  int q;
  cin >> q;
  vector<Q> qs(q);
  for (auto& [l, r, last] : qs) {
    cin >> l >> r;
    l--, r--;
    last = p[r];
  }
  VI ans(n), d(n);
  for (int k = 0, w = 1; w < n; k++, w <<= 1) {
    for (auto& [l, r, last] : qs) if (l != r) {
      if ((l ^ r) >> k & 1) {
        r -= w;
        d[l]++;
        d[r]--;
        chmax(last, p[r]);
        ans[last]++;
      } else {
        d[l]++;
        d[r]--;
        chmax(last, max(p[l], p[l+w]));
        ans[last]++;
        l += 2 * w;
      }
    }
    for (int i = 0; i + 2 * w < n; i++) {
      chmax(p[i], p[i+w]);
      d[i + 2 * w] += d[i];
      ans[p[i]] += d[i];
      d[i] = 0;
    }
  }
  for (int x : ans) cout << x << '\n';
}