#define STOPIT
#include <bits/stdc++.h>
#define loop(n) for (lint ngtkana_is_a_genius = 0; ngtkana_is_a_genius < lint(n); ngtkana_is_a_genius++)
#define rep(i, begin, end) for (lint i = lint(begin); (i) < lint(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto& a, auto b){ if (a > b) {a = b; return true;} return false; };
auto cmx = [](auto& a, auto b){ if (a < b) {a = b; return true;} return false; };
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) { std::cerr << " " << head; debug_impl(tail...); }
#ifndef STOPIT
#define debug(...)\
  do {\
    std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:";\
    debug_impl(__VA_ARGS__);\
    std::cerr << std::noboolalpha;\
  } while (false)
#else
#define debug(...) {}
#endif

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr>
std::istream& operator>> (std::istream& is, Container& v)
  { for (auto & x : v) { is >> x; } return is; }

template < typename Container, typename Value = typename Container::value_type, std::enable_if_t<!std::is_same< Container, std::string >::value, std::nullptr_t> = nullptr >
std::ostream& operator<< (std::ostream& os, Container const& v) {
 os << "{";
  for (auto it = v.begin(); it != v.end(); it++)
    {os << (it != v.begin() ? "," : "") << *it;}
  return os << "}";
}

template <typename T>
auto make_vector_impl(size_t sz, T t) {return std::vector<T>(sz, t);}

template <size_t N, typename T, typename U, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz, U u) {return make_vector_impl(sz, T(u));}

template <size_t N, typename T, std::enable_if_t<N == 1, std::nullptr_t> = nullptr>
auto make_vector(size_t sz) {return std::vector<T>(sz);}

template <size_t N, typename T, typename... Args, std::enable_if_t<N != 1, std::nullptr_t> = nullptr>
auto make_vector(size_t a, Args... args) {return make_vector_impl(a, make_vector<N - 1, T>(args...));}

template <typename T, typename Size_t>
auto& at(T& t, Size_t i) {return t.at(i);}

template <typename T, typename Size_t, typename... Args>
auto& at(T& t, Size_t i, Args... args) {return at(t.at(i), args...);}

/*
その場所から1日でどのホテルまで行けるかを、尺取りか二分探索で前計算です。
さらに、2冪日でどこまで行けるのかを前計算して、ダブリングで日数を計算です。
*/

int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  int n; std::cin >> n;
  std::vector<lint> pos(n); std::cin>>pos;
  debug(pos);
  lint L; std::cin >> L;

  int ht = std::log2(n);
  auto table = make_vector<2,int>(ht,n);
  auto& next = table.front();
  {
    int j = 0;
    rep(i,0,n) {
      int x = pos.at(i);
      while (j < n - 1 && pos.at(j+1) <= x + L) j++;
      next.at(i) = j;
    }
    debug(next);
  }
  rep(i,1,ht) {
    auto&& crr = table.at(i);
    auto&& prv = table.at(i-1);
    rep(j,0,n) {
      crr.at(j) = prv.at(prv.at(j));
    }
    debug(crr);
  }

  int q; std::cin >> q;
  loop(q) {
    int a, b; std::cin >> a >> b;
    a--,b--;
    if (a > b) std::swap(a,b);
    debug(a,b);

    int ans = 0;
    int I = 1 << (ht-1);
    for (int i=ht-1; i >= 0; i--, I /= 2) {
      int nxt = at(table,i,a);
      if (nxt < b) {
        a = nxt;
        ans += I;
      }
    }
    assert(next.at(a) == b);
    ans++;
    std::cout << ans << std::endl;
  }
  return 0;
}