#include <bits/stdc++.h>
using namespace std;
inline long long modpow(long long x, long long y,
                        long long m = (long long)((1e9) + 7)) {
  long long res = 1;
  while (y) {
    if (y & 1) {
      res *= x;
      res %= m;
    }
    x = x * x % m;
    y /= 2;
  }
  return res;
}
long long mypow(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y % 2) {
      res *= x;
    }
    x = x * x;
    y /= 2;
  }
  return res;
}
bool prime(long long x) {
  if (!x || x == 1) {
    return false;
  }
  for (long long i = 2; i * i <= x; i++) {
    if (!(x % i)) {
      return false;
    }
  }
  return true;
}
inline long long gcd(long long x, long long y) {
  if (!y) {
    return x;
  }
  return gcd(y, x % y);
}
long long keta(long long x) {
  long long ans = 0;
  while (x) {
    x /= 10;
    ans++;
  }
  return ans;
}
long long ketasum(long long x) {
  long long ans = 0;
  while (x) {
    ans += x % 10;
    x /= 10;
  }
  return ans;
}
inline long long lcm(long long x, long long y) {
  long long ans = x / gcd(x, y) * y;
  return ans;
}
long long twobeki(long long x) {
  long long ans = 0;
  while (1) {
    if (!(x & 1)) {
      ans++;
      x /= 2;
    } else {
      break;
    }
  }
  return ans;
}
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
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 comb(long long x, long long y) {
  if (y > x) return 0;
  return kai(x, y) * modpow(kai(y, y), (long long)((1e9) + 7) - 2) %
         (long long)((1e9) + 7);
}
template <class T>
class SegTree {
  long long n;
  vector<T> node;
  T def;
  function<T(T, T)> operation;
  function<T(T, T)> update;

 public:
  SegTree(unsigned long long _n, T _def, function<T(T, T)> _operation,
          function<T(T, T)> _update)
      : def(_def), operation(_operation), update(_update) {
    n = 1;
    while (n < _n) {
      n *= 2;
    }
    node = vector<T>(n * 2, def);
  }
  SegTree(vector<long long>& initvec, function<T(T, T)> _operation,
          function<T(T, T)> _update)
      : operation(_operation), update(_update) {
    n = 1;
    while (n < initvec.size()) {
      n *= 2;
    }
    node = vector<T>(n * 2, def);
    for (long long i = n; i < n + initvec.size(); i++) {
      node[i] = initvec[i - n];
    }
    for (long long i = n - 1; i >= 1; i--) {
      node[i] = operation(node[i * 2], node[i * 2 + 1]);
    }
  }
  void change(long long i, T x) {
    i += n;
    node[i] = update(node[i], x);
    while (i >= 1) {
      i >>= 1;
      node[i] = operation(node[i * 2], node[i * 2 + 1]);
    }
  }
  T query(long long l, long long r) {
    l += n;
    r += n;
    T rx = def, lx = def;
    while (l < r) {
      if (l & 1) {
        lx = operation(lx, node[l]);
        l++;
      }
      if (r & 1) {
        r--;
        rx = operation(node[r], rx);
      }
      l >>= 1;
      r >>= 1;
    }
    return operation(lx, rx);
  }
  T operator[](const long long& x) { return node[x - n]; }
  void fill(T x) { std::fill(node.begin(), node.end(), x); }
  void print() {
    for (long long i = 0; i < n; i++) std::cout << operator[](i) << " ";
    std::cout << std::endl;
  }
};
class Union_Find {
  vector<long long> par;
  vector<long long> rankmy;
  vector<long long> ookisa;

 public:
  Union_Find(long long size) {
    par = vector<long long>(size);
    rankmy = vector<long long>(size);
    ookisa = vector<long long>(size);
    for (long long i = 0; i < size; i++) {
      par[i] = i;
      ookisa[i] = 1;
    }
  }
  long long find(long long x) {
    if (par[x] == x) {
      return x;
    }
    return par[x] = find(par[x]);
  }
  void unite(long long x, long long y) {
    x = find(x);
    y = find(y);
    if (x == y) {
      return;
    }
    if (rankmy[x] < rankmy[y]) {
      par[x] = y;
      ookisa[y] += ookisa[x];
      ookisa[x] = 0;
    } else {
      par[y] = x;
      ookisa[x] += ookisa[y];
      ookisa[y] = 0;
      if (rankmy[x] == rankmy[y]) {
        rankmy[x]++;
      }
    }
  }
  long long size(long long i) {
    i = find(i);
    return ookisa[i];
  }
  bool same(long long x, long long y) { return find(x) == find(y); }
};
class BIT {
  vector<long long> data;
  long long size = 0;

 public:
  BIT(long long _size) {
    data = vector<long long>(_size + 1);
    size = _size;
  }
  void add(long long i, long long x) {
    while (i <= size) {
      data[i] += x;
      i += i & -i;
    }
  }
  long long sum(long long i) {
    assert(i <= size);
    long long s = 0;
    while (i > 0) {
      s += data[i];
      i -= i & -i;
    }
    return s;
  }
  long long lower_bound(long long x) {
    if (x <= 0) {
      return 0;
    } else {
      long long i = 0;
      long long r = 1;
      while (r < size) r = r << 1;
      for (long long len = r; len > 0; len = len >> 1) {
        if (i + len < size && data[i + len] < x) {
          x -= data[i + len];
          i += len;
        }
      }
      return i + 1;
    }
  }
};
long long perm[1000005];
void init_perm() {
  perm[0] = 1;
  for (long long i = 1; i <= 1000000; i++) {
    perm[i] = perm[i - 1] * i % (long long)((1e9) + 7);
  }
}
long long nCk(long long x, long long y) {
  return perm[x] * modpow(perm[x - y], (long long)((1e9) + 7) - 2) %
         (long long)((1e9) + 7) * modpow(perm[y], (long long)((1e9) + 7) - 2) %
         (long long)((1e9) + 7);
}
double kyori(pair<long long, long long> f, pair<long long, long long> s) {
  double ans = 0;
  double t = fabs(f.first - s.first);
  double y = fabs(f.second - s.second);
  ans = sqrt(t * t + y * y);
  return ans;
}
inline string stringmax(string& x, string& y) {
  if (x.size() > y.size()) {
    return x;
  }
  if (x.size() < y.size()) {
    return y;
  }
  for (long long i = 0; i < x.size(); i++) {
    if (x[i] > y[i]) {
      return x;
    }
    if (x[i] < y[i]) {
      return y;
    }
  }
  return x;
}
vector<long long> RollingHash(string& s, string& t) {
  vector<long long> ans;
  __int128 h = 0, hamod = 0, ki = 0, kim = 0, hikaku = 0, one = 0;
  one = 1;
  ki = 1000000007ll;
  hamod = (one << 61) - 1;
  kim = 1;
  for (long long i = 0; i < t.size(); i++) {
    hikaku *= ki;
    h *= ki;
    kim *= ki;
    hikaku += t[i];
    h += s[i];
    hikaku %= hamod;
    h %= hamod;
    kim %= hamod;
  }
  for (long long i = 0; i < (long long)s.size() - (long long)t.size() + 1;
       i++) {
    if (h == hikaku) {
      ans.emplace_back(i);
    }
    h *= ki;
    h %= hamod;
    h += s[i + (long long)t.size()];
    h %= hamod;
    h += hamod;
    h -= s[i] * kim % hamod;
    h %= hamod;
  }
  return ans;
}
struct edge {
  long long to;
  long long length;
  edge(long long _to, long long _length) {
    to = _to;
    length = _length;
  }
};
vector<long long> djkstra(vector<vector<edge>>& road, long long start) {
  vector<long long> kyo(road.size(), (long long)(3e18));
  priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,
                 greater<pair<long long, long long>>>
      q;
  q.push({0, start});
  kyo[start] = 0;
  while (q.size()) {
    long long x = q.top().second;
    long long now = q.top().first;
    q.pop();
    if (kyo[x] < now) {
      continue;
    }
    for (auto& i : road[x]) {
      if (kyo[i.to] > now + i.length) {
        kyo[i.to] = now + i.length;
        q.push({kyo[i.to], i.to});
      }
    }
  }
  return kyo;
}
long long n, x[100004], l, q, a, b, dp[100004];
signed main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> x[i];
  }
  cin >> l >> q;
  for (long long i = n - 2; i >= 0; i--) {
    long long basho = upper_bound(x, x + n, x[i] + l) - x;
    basho--;
    dp[i] = dp[basho] + 1;
  }
  for (long long i = 0; i < q; i++) {
    cin >> a >> b;
    a--;
    b--;
    if (a > b) {
      swap(a, b);
    }
    cout << max(1ll, dp[a] - dp[b]) << "\n";
  }
}
