#include <iostream>
#include <cstdio>
#define N 100005
using namespace std;
int n, l, q, x, y, k, s, a[N], b[N][20];
int main() {
	int i, j;
	scanf("%d", &n);
	for(i=1; i<=n; i++) scanf("%d", &a[i]);
	scanf("%d%d", &l, &q);
	for(i=j=1; i<n; i++) {
		for(; j<n && a[j+1]-a[i]<=l; j++);
		b[i][0] = j;
	}
	for(j=1; b[1][j-1]; j++) for(i=1; i<n; i++) {
		b[i][j] = b[b[i][j-1]][j-1];
	}
	k = j-2;
	while(q--) {
		scanf("%d%d", &x, &y);
		if(x>y) swap(x, y);
		for(j=k, s=0; j>=0; j--) {
			if(!b[x][j]) continue;
			if(b[x][j] < y) {
				s += 1<<j;
				x = b[x][j];
			}
		}
		printf("%d\n", s+1);
	}
	return 0;
}