import java.io.IOException;
import java.io.InputStream;
import java.util.HashMap;
import java.util.Map;
import java.util.NoSuchElementException;

public class Main {
    public static void main(String[] args) {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int[] x = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            x[i] = sc.nextInt();
        }
        int l = sc.nextInt();
        int q = sc.nextInt();
        int[] a = new int[q + 1];
        int[] b = new int[q + 1];
        for (int i = 1; i <= q; i++) {
            a[i] = sc.nextInt();
            b[i] = sc.nextInt();
        }
        Map<Integer, Integer> reachable = new HashMap<>();
        for (int i = 1; i <= n; i++) {
            int pos = i;
            while (pos <= n && x[pos] <= x[i] + l) {
                pos++;
            }
            reachable.put(i, pos - 1);
        }
        Map<Integer, Integer> reachablerev = new HashMap<>();
        for (int i = n; i >= 1; i--) {
            int pos = i;
            while (pos >= 1 && x[pos] >= x[i] - l) {
                pos--;
            }
            reachablerev.put(i,pos + 1);
        }
        for (int i = 1; i <= q; i++) {
            int pos = a[i];
            int dir = a[i] <= b[i] ? 1 : -1;
            int days = 0;
            while (pos * dir < b[i] * dir) {
                pos = dir == 1 ? reachable.get(pos) : reachablerev.get(pos);
                days++;
            }
            System.out.println(days);
        }

    }
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte()) return buffer[ptr++];
        else return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}
