#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
using namespace std;
using pii  = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
  if('0' <= c && c <= '9') return (c-'0');
  return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
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; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
  for(auto i=begin(v); i != end(v); ++i){
    if(i !=begin(v)) os << ' ';
    os << *i;
  }
  return os;
}

// modint

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
    u64 exp = Modulus - 2;
    while (exp) {
      if (exp % 2) {
        *this *= rhs;
      }
      rhs *= rhs;
      exp /= 2;
    }
    return *this;
  }
};

ll X[100007];
vector<vector<ll>> V;
bool C[100007];
ll P[100007];

int main(){
  ll N,L,Q;
  cin >> N;
  rep(i,N){
    cin >> X[i];
  }
  ll K=-1;
  cin >> L >> Q;
  rep(i,N){
    if(C[i]==0){
      V.pb(vector<ll>(0));
      K++;
      V[K].pb(i);
      P[i]=K;
      C[i]=1;
      ll key=i;
      while(1){
        key=upper_bound(X,X+N,X[key]+L)-X-1;
        V[K].pb(key);
        if(C[key]==1) {
          break;
        }
        else{
          C[key]=1;
          P[key]=K;
        }
      }
    }
  }
  rep(i,Q){
    ll A,B;
    cin >> A >> B;
    A--;B--;
    if(B<A) swap(A,B);
    ll key=P[A];
    ll ANS=0;
    ll Z=A;
    while(1){
      ll T=lower_bound(ALL(V[key]),B)-V[key].begin();
      ll S=lower_bound(ALL(V[key]),Z)-V[key].begin();
      ll W=V[key].size();
      //cout << Z << " " << ANS << " " << T << endl;
      if(T==W){
        ANS+=W-1-S;
        Z=V[key][W-1];
        key=P[Z];
      }
      else{
        ANS+=T-S;
        break;
      }
    }
    cout << ANS << endl;
  }
}

// bool C1[100007],C2[100007];

// int main(){
//   ll N,L,Q;
//   cin >> N ;
//   rep(i,N){
//     ll x;
//     cin >> x;X.pb(x);
//   }
//   cin >> L >> Q;

//   graph1 = AdjList(N+1);
//   graph2 = AdjList(N+1);
//   C1[0]=1;
//   ll key=0,P=X[0];
//   while(1){
//     ll pre = key;
//     key=upper_bound(X.begin(),X.end(),X[key]+L)-X.begin();
//     key--;
//     C1[key]=1;
//     P=X[key];
//     graph1[pre].pb(Edge(key,1));
//     cout << pre <<" "<< key << " " << 1 <<endl;
//     Rep(i,pre+1,key){
//       graph1[key].pb(Edge(i,0));
//       cout << key <<" "<< i << " " << -1 <<endl;
//     }
//     if(key==N-1){
//       break;
//     }
//   }
//   rep(i,N){
//     if(C1[i]==0){
//       key=upper_bound(X.begin(),X.end(),X[i]+L)-X.begin();
//     }
//     key--;
//     graph1[i].pb(Edge(key,1));
//     cout << i <<" "<< key << " " << 1 <<endl;
//   }


//   key=N-1,P=X[N-1];
//   while(1){
//     ll pre = key;
//     key=lower_bound(X.begin(),X.end(),X[key]-L)-X.begin();
//     C2[key]=1;
//     P=X[key];
//     graph1[pre].pb(Edge(key,1));
//     Rep(i,key+1,pre){
//       graph1[key].pb(Edge(i,0));
//     }
//     if(key==0){
//       break;
//     }
//   }
//   rep(i,N){
//     if(C2[i]==0){
//       key=lower_bound(X.begin(),X.end(),X[i]-L)-X.begin();
//     }
//     graph1[i].pb(Edge(key,1));
//   }
//   bool F1 = bellman_ford1(N, 0);
//   bool F2 = bellman_ford2(N, N-1);
//   rep(i,Q){
//     ll A,B;
//     cin >> A >> B;
//     A--;B--;
//     if(A<B){
//       cout << DIS1[B]-DIS1[A] << endl;
//     }
//     else{
//       cout << DIS2[A]-DIS2[B] << endl;
//     }
//   }
// }

Measured memory_bytes: 10312