#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using piii = pair<pii, int>;
using pll = pair<long long, long long>;
using plll = pair<pll, long long>;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
};
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
};
inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
  cin >> first;
  in(rest...);
  return;
}
inline void out(void) {
  cout << "\n";
  return;
}
template <typename First, typename... Rest>
void out(First first, Rest... rest) {
  cout << first << " ";
  out(rest...);
  return;
}
const double EPS = 1e-9;
const int mod = 1e9 + 7;
const int INF = 1e9;
const long long INFLL = 1e18;
void iosetup() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T>
pair<S, T> operator*(const pair<S, T> &s, const S &t) {
  return pair<S, T>(s.first * t, s.second * t);
}
template <typename T>
void Exit(T first) {
  cout << first << endl;
  exit(0);
};
template <int mod>
struct ModInt {
  int x;
  ModInt() : x(0) {}
  ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod) x -= mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p) {
    x = (int)(1LL * x * p.x % mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const { return ModInt(-x); }
  ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
  ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
  ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
  ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
  bool operator==(const ModInt &p) const { return x == p.x; }
  bool operator!=(const ModInt &p) const { return x != p.x; }
  ModInt inverse() const {
    int a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  ModInt pow(int64_t n) const {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1) ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
  friend istream &operator>>(istream &is, ModInt &a) {
    int64_t t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
  static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const pii dxy[4] = {pii(1, 0), pii(0, 1), pii(-1, 0), pii(0, -1)};
const int calender[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int ucalender[13] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
bool range(int a, int b, int x) {
  if (a <= x and x < b)
    return true;
  else
    return false;
}
bool range(int a, int b, int c, int d, pii p) {
  if (a <= p.first and p.first < b and c <= p.second and p.second < d)
    return true;
  else
    return false;
}
template <typename T>
struct edge {
  int src, to;
  T cost;
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
  operator int() const { return to; }
};
template <typename T>
using Edges = vector<edge<T> >;
template <typename T>
using WeightedGraph = vector<Edges<T> >;
using UnWeightedGraph = vector<vector<int> >;
template <typename T>
using Matrix = vector<vector<T> >;
void add_edge(UnWeightedGraph &g, int x, int y) {
  g[x].push_back(y);
  g[y].push_back(x);
}
template <typename T>
void add_edge(WeightedGraph<T> &g, int x, int y, T c) {
  g[x].push_back({y, c});
  g[y].push_back({x, c});
}
template <typename T>
struct dijkstra {
 private:
  WeightedGraph<T> g;
  int s;
  int V;
  vector<int> Prev;
  vector<T> Dist;

 public:
  using Pi = pair<T, int>;
  dijkstra(WeightedGraph<T> &G, int S) {
    g = G;
    s = S;
    V = G.size();
    Prev.resize(V, -1);
    Dist.resize(g.size(), INF);
  }
  vector<T> dist() {
    priority_queue<Pi, vector<Pi>, greater<Pi> > que;
    Dist[s] = 0;
    que.emplace(Dist[s], s);
    while (!que.empty()) {
      T cost;
      int idx;
      tie(cost, idx) = que.top();
      que.pop();
      if (Dist[idx] < cost) continue;
      for (auto &e : g[idx]) {
        auto next_cost = cost + e.cost;
        if (Dist[e.to] <= next_cost) continue;
        Dist[e.to] = next_cost;
        Prev[e.to] = idx;
        que.emplace(Dist[e.to], e.to);
      }
    }
    return Dist;
  }
  vector<int> get_path(int t) {
    vector<int> path;
    for (; t != -1; t = Prev[t]) path.push_back(t);
    reverse(path.begin(), path.end());
    return path;
  }
};
int main() {
  iosetup();
  int N;
  cin >> N;
  vector<int> x(N);
  cin >> x;
  int L, Q;
  cin >> L >> Q;
  WeightedGraph<int> g(N);
  for (int i = 0; i < N - 1; i++) {
    auto it = upper_bound(x.begin(), x.end(), x[i] + L) - x.begin();
    it--;
    add_edge(g, i, it, 1);
  }
  dijkstra<int> ds(g, N - 1);
  auto dist = ds.dist();
  while (Q--) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    if (b < a) swap(a, b);
    cout << dist[a] - dist[b] << endl;
  }
  return 0;
}
