#include <bits/stdc++.h>
using namespace std;
vector<tuple<int, int, int>> s[2][100000];
int N;
int x[100000];
int L, Q;
int ans[100000];
int dist[100000];
int bs;
void solve(int dir) {
  for (int i = 0; i < (int)(N - 1); i++) {
    int nxt = upper_bound(x, x + N, x[i] + L) - 1 - x;
    if (s[dir][i].size() < bs) {
      for (const auto &t : s[dir][i]) {
        int b, j, cost;
        tie(b, j, cost) = t;
        if (nxt >= b) {
          ans[j] = cost + 1;
        } else {
          s[dir][nxt].emplace_back(b, j, cost + 1);
        }
      }
    } else {
      int c = 1, d = 0;
      dist[i] = 0;
      for (int j = i + 1; j < N; j++) {
        d += x[j] - x[j - 1];
        if (d > L) {
          d = x[j] - x[j - 1];
          c++;
        }
        dist[j] = c;
      }
      for (const auto &t : s[dir][i]) {
        int b, j, cost;
        tie(b, j, cost) = t;
        ans[j] = cost + dist[b];
      }
    }
    s[dir][i].~vector<tuple<int, int, int>>();
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N;
  for (int i = 0; i < (int)(N); i++) cin >> x[i];
  cin >> L >> Q;
  bs = sqrt(Q);
  for (int i = 0; i < (int)(Q); i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    if (a < b) {
      s[0][a].emplace_back(b, i, 0);
    } else {
      a = N - a - 1;
      b = N - b - 1;
      s[1][a].emplace_back(b, i, 0);
    }
  }
  solve(0);
  reverse(x, x + N);
  for (int i = 0; i < (int)(N); i++) x[i] *= -1;
  solve(1);
  for (int i = 0; i < (int)(Q); i++) cout << ans[i] << endl;
  return 0;
}
