import sys
input = sys.stdin.readline
from bisect import *

def judge(a, b, x):
    now = a
    c = 0
    
    while x>0:
        if x&1:
            now = dp[c][now]
        
        x >>= 1
        c += 1
    
    return now>=b
    
def binary_search(a, b):
    l, r = 0, N-1
    
    while l<=r:
        m = (l+r)//2
        
        if judge(a, b, m):
            r = m-1
        else:
            l = m+1
    
    return l

N = int(input())
x = list(map(int, input().split()))
L = int(input())
log_size = 22
dp = [[0]*N for _ in range(log_size)]

for i in range(N):
    dp[0][i] = bisect_right(x, x[i]+L)-1
    
for i in range(1, log_size):
    for j in range(N):
        dp[i][j] = dp[i-1][dp[i-1][j]]

Q = int(input())

for _ in range(Q):
    a, b = map(int, input().split())
    a, b = min(a, b)-1, max(a, b)-1
    print(binary_search(a, b))