#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 998244353;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };

namespace {
    template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
    template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t szi, szj;
        inp(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
        template <typename T> operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
        }
    };
    inp inp1;
}

int main() {

    int n = inp1;
    vector<ll> x = inp(n);
    ll l = inp1;
    int q = inp1;
    vector<int> a(q), b(q);
    rep(i, q) cin >> a[i] >> b[i], --a[i], --b[i];
    rep(i, q) if (a[i] > b[i]) swap(a[i], b[i]);

    // どこまでいけるか 多い分に越したことはない
    vector<int> next(n);
    rep(i, n) {
        ll to = x[i] + l;
        next[i] = upper_bound(allof(x), to) - x.begin() - 1;
        chmax(next[i], 0);
    }

    vector<vector<int>> dp(n, vector<int>(62, 0));
    rep(i, n) dp[i][0] = next[i];
    rep(j, 61) {
        rep(i, n) {
            dp[i][j + 1] = dp[dp[i][j]][j];
        }
    }

    rep(i, q) {
        int goal = b[i];

        // 何回移動するかで二分探索
        int left = 0;
        int right = n + 1;
        while (right - left > 1) {
            int mid = (right + left) / 2;

            int cur = a[i];

            int cnt = 0;
            int mask = 1;
            while (mask <= mid) {
                if (mask & mid) cur = dp[cur][cnt];
                ++cnt;
                mask <<= 1;
            }

            if (cur >= goal) right = mid;
            else left = mid;
        }
        Cout(left + 1);
    }

    return 0;
}


Measured memory_bytes: 30080