#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

vector<vector<int>> adjp, adjm;

int main() {
  int N; cin >> N;
  ll x[N]; rep(i,N) cin >> x[i];
  ll L; cin >> L;
  adjp.resize(N); adjm.resize(N);
  rep(i,N) {
    if (i!=N-1) {
      auto parp = upper_bound(x,x+N,x[i]+L)-1;
      adjp[parp-x].push_back(i);
      // cout << x[i] << " " << parp-x << endl;
    }
    if (i!=0) {
      auto parm = lower_bound(x,x+N,x[i]-L);
      adjm[parm-x].push_back(i);
      // cout << x[i] << " " << parp-x << endl;
    }
  }

  int dp[N] = {}, dm[N] = {};
  per(i,N) for (auto x: adjp[i]) dp[x] = dp[i]+1;
  rep(i,N) for (auto x: adjm[i]) dm[x] = dm[i]+1;  
  // debug(dp,dp+N); debug(dm,dm+N);

  int Q; cin >> Q;
  rep(i,Q) {
    int a, b; cin >> a >> b; a--; b--;
    if (a>b) swap(a,b);
    int result = dm[a]==dm[b] ? 1 : dm[b]-dm[a];
    cout << result << endl;
  }
  return 0;
}