#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
ostream &operator<<(ostream &os, pair<ll, ll>&p){
  return os << p.first << " " << p.second;
}  
template<typename T>
struct Doubling
{
  const ll LOG = 21;
  vector< vector< T > > table;
  
  Doubling(ll sz)
  {
    table.assign(LOG, vector< T >(sz, -1));
  }

  void set_next(ll k, T x)
  {
    table[0][k] = x;
  }

  void build()
  {
    for(ll k = 0; k + 1 < LOG; k++) {
      for(ll i = 0; i < table[k].size(); i++) {
        if(table[k][i] == -1) table[k + 1][i] = -1;
        else table[k + 1][i] = table[k][table[k][i]];
      }
    }
  }
  ll query1(ll k, ll t)//tにたどり着く最小手数を求める
  {
    ll ret = 1;
    for(ll i = LOG - 1; i >= 0; i--){
      if(table[i][k] != -1 && table[i][k] < t){
        ret += 1 << i;
        k = table[i][k];
      }
    }
    if(table[0][k] >= t)return ret;
    else return -1;
  }
  ll query2(ll k, ll t)//t個先の要素を求める
  {
    for(ll i = LOG - 1; i >= 0; i--) {
      if((t >> i) & 1) k = table[i][k];
    }
    return k;
  }
};

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>x(n);
  vector<ll>tw(32,1);
  rep(i,1,32){
    tw[i]=tw[i-1]*2;
  }
  rep(i,0,n)cin>>x[i];
  ll l,q;cin>>l>>q;
  vector<ll>a(q),b(q);
  rep(i,0,q){
    cin>>a[i]>>b[i];
    a[i]--;b[i]--;
  }
  Doubling<ll>dbl(n);
  rep(i,0,n)dbl.set_next(i,upper_bound(ALL(x),x[i]+l)-x.begin()-1);
  dbl.build();
  rep(i,0,q)cout<<dbl.query1(min(a[i],b[i]),max(a[i],b[i]))<<endl;
  return 0;
}

Measured memory_bytes: 19840