#include <bits/stdc++.h>
using namespace std;

inline int64_t in() { int64_t x = 0; cin >> x; return x; }

int main() {
  int n = in();

  vector<int> x(n);
  for (auto &i : x) cin >> i;

  int L = in();

  vector<vector<int>> d(20, vector<int>(n + 1, n));
  for (int i = 0; i < n; ++i) {
    d[0][i] = lower_bound(x.begin(), x.end(), x[i] + L + 1) - x.begin() - 1;
  }

  for (int i = 1; i < 20; ++i) {
    for (int j = 0; j < n; ++j) {
      d[i][j] = d[i - 1][d[i - 1][j]];
    }
  }

  int q = in();
  while (q--) {
    int a = in() - 1, b = in() - 1;
    if (b < a) swap(a, b);

    int ans = 1;
    for (int i = 19; i >= 0; --i) {
      if (d[i][a] < b) {
        ans += (1 << i);
        a = d[i][a];
      }
    }

    cout << ans << endl;
  }
}
