#include <bits/stdc++.h>
#pragma GCC optimize("O3")
long mod(long a) {
  long long c = a % (long long)(1e9 + 7);
  if (c >= 0) return c;
  return c + (long long)(1e9 + 7);
}
long long po(long a, long b) {
  if (b == 0) {
    return 1;
  }
  long long z = po(a, b / 2);
  z = mod(z * z);
  if (b % 2 != 0) {
    z = mod(a * z);
  }
  return z;
}
using namespace std;
bool prime_(int n) {
  if (n == 1) {
    return false;
  } else if (n == 2) {
    return true;
  } else {
    for (int i = 2; i <= sqrt(n); i++) {
      if (n % i == 0) {
        return false;
      }
    }
    return true;
  }
}
long long gcd_(long long a, long long b) {
  if (a < b) {
    swap(a, b);
  }
  if (a % b == 0) {
    return b;
  } else {
    return gcd_(b, a % b);
  }
}
long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }
int main() {
  int n;
  cin >> n;
  int x[n];
  for (int i = 0; i < n; i++) {
    cin >> x[i];
  }
  int L;
  cin >> L;
  int s[n][31];
  for (int i = 0; i < n; i++) {
    int l = i, r = n;
    while (r - l > 1) {
      int m = (l + r) / 2;
      if (x[m] - x[i] <= L) {
        l = m;
      } else {
        r = m;
      }
    }
    s[i][0] = l;
  }
  for (int k = 0; k < 31; k++) {
    for (int i = 0; i < n; i++) {
      if (k == 0) continue;
      s[i][k] = s[s[i][k - 1]][k - 1];
    }
  }
  int q;
  cin >> q;
  int a[q], b[q];
  for (int i = 0; i < q; i++) {
    cin >> a[i] >> b[i];
    a[i]--;
    b[i]--;
    if (a[i] > b[i]) {
      swap(a[i], b[i]);
    }
  }
  int ans[q];
  for (int i = 0; i < q; i++) {
    int l = 0, r = 1e9 + 10;
    while (r - l > 1) {
      int d = (l + r) / 2;
      int now = a[i];
      for (int k = 0; k < 31; k++) {
        if (d & (1 << k)) {
          now = s[now][k];
        }
      }
      if (now >= b[i]) {
        r = d;
      } else {
        l = d;
      }
    }
    ans[i] = l;
  }
  for (int i = 0; i < q; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}
