#include<stdio.h>
#include<algorithm>
using namespace std;
int n,l,a[111111];
int nex[111111][22];
int calc(int x,int y){
	if(nex[x][0] >= y)return 1;
	int p = 0;
	while(nex[x][p] < y)p++;
	--p;
	return (1<<p) + calc(nex[x][p],y);
}
int main(){
	scanf("%d",&n);
	for(int i=1; i<=n; i++)
		scanf("%d",&a[i]);
	scanf("%d", &l);
	for(int i=n; i>=1; i--){
		if(i==n){
			for(int j=0; j<=17; j++)
				nex[i][j] = n;
		}else{
			nex[i][0] = upper_bound(a+1,a+n+1,a[i]+l)-a-1;
			for(int j=1; j<=17; j++){
				nex[i][j] = nex[nex[i][j-1]][j-1];
			}
		}
	}
	int q;
	for(scanf("%d",&q); q--;){
		int x,y;
		scanf("%d%d", &x, &y);
		if(x>y)swap(x,y);
		printf("%d\n",calc(x,y));
	}
	return 0;
}