#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e6 + 50;
int n, l, q, first[N];
int f[20][N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", first + i);
  scanf("%d%d", &l, &q);
  int now = n;
  for (int i = n; i >= 1; --i) {
    while (first[now] - first[i] > l) --now;
    f[0][i] = now;
    for (int j = 1; j <= 20; ++j) f[j][i] = f[j - 1][f[j - 1][i]];
  }
  for (int i = 1; i <= q; ++i) {
    int first, second;
    scanf("%d%d", &first, &second);
    if (first > second) swap(first, second);
    int ans = 0;
    for (int i = 20; i >= 0; --i)
      if (f[i][first] < second) {
        first = f[i][first];
        ans ^= 1 << i;
      }
    printf("%d\n", ans + 1);
  }
}
