#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void chmax(T& a, T b) {
  a = std::max(a, b);
}
template <class T>
inline void chmin(T& a, T b) {
  a = std::min(a, b);
}
bool prime(long long x) {
  for (long long i = 2; i * i <= x; i++) {
    if (x % i == 0) return false;
  }
  return x != 1;
}
long long gcd(long long x, long long y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long kai(long long x, long long y) {
  long long res = 1;
  for (long long i = x - y + 1; i <= x; i++) {
    res *= i;
    res %= (long long)(1e9 + 7);
  }
  return res;
}
long long mod_pow(long long x, long long y, long long m) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) {
      res = res * x % m;
    }
    x = x * x % m;
    y >>= 1;
  }
  return res;
}
long long comb(long long x, long long y) {
  if (y > x) return 0;
  return kai(x, y) *
         mod_pow(kai(y, y), (long long)(1e9 + 7) - 2, (long long)(1e9 + 7)) %
         (long long)(1e9 + 7);
}
long long get_rand(long long MIN, long long MAX) {
  std::random_device rnd;
  std::mt19937_64 mt64(rnd());
  std::uniform_int_distribution<long long> engine(MIN, MAX);
  return engine(mt64);
}
long long n, l;
long long x[114514];
long long to[114514][30];
void init() {
  for (long long i = 0; i < n; i++) {
    long long index = upper_bound(x, x + n, x[i] + l) - x;
    index--;
    to[0][i] = index;
  }
  for (long long i = 0; i < 30; i++) {
    for (long long j = 0; j < n; j++) {
      to[i + 1][j] = to[i][to[i][j]];
    }
  }
}
long long query(long long s, long long t) {
  long long ans = 0;
  for (long long i = 29; i >= 0; i--) {
    if (to[i][s] < t) {
      ans += 1 << i;
      s = to[i][s];
    }
  }
  return ans + 1;
}
signed main() {
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> x[i];
  cin >> l;
  init();
  long long q;
  cin >> q;
  while (q--) {
    long long s, t;
    cin >> s >> t;
    s--;
    t--;
    if (s > t) swap(s, t);
    cout << query(s, t) << endl;
  }
}
