#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a)-1;i>=(b);i--)
#define pb push_back

typedef long long ll;
using namespace std;
int MOD = 1000000007;
int N, L, Q;
map<int, int> m;
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> N;
  int tree[18][N], X[N];
  FOR(i, 0, N){
    int x;
    cin >> x;
    m[~x] = i;
    X[i] = ~x;
  }
  cin >> L >> Q;

  FOR(i, 0, N) tree[0][i] = m.lower_bound(X[i] - L) -> second;
  FOR(i, 1, 18) FOR(j, 0, N) tree[i][j] = tree[i-1][tree[i-1][j]];

  FOR(i, 0, Q){
    int a, b, s = 0;
    cin >> a >> b;
    if(a > b) swap(a, b);
    a -= 1;
    b -= 1;
    FORR(j, 18, 0){
      if(tree[j][a] < b){
        s += (1 << j);
        a = tree[j][a];
      }
    }
    cout << s+1 << "\n";
  }
}
