#include <bits/stdc++.h>
using namespace std;
int ai[20000];
int nx[20][20000], q, s, n, L;
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> ai[i];
  cin >> L;
  for (int i = 1, j = i; i <= n; ++i) {
    while (j < n && ai[j + 1] - ai[i] <= L) j++;
    nx[0][i] = j;
  }
  for (s = 1; (1 << s) <= n; ++s)
    for (int j = 1; j <= n; ++j) nx[s][j] = nx[s - 1][nx[s - 1][j]];
  s--;
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    int l, r, ans = 0;
    cin >> l >> r;
    if (l > r) swap(l, r);
    for (int i = s; ~i; --i)
      if (nx[i][l] < r) l = nx[i][l], ans += 1 << i;
    cout << ans + 1 << "\n";
  }
}
