#include <bits/stdc++.h>
using namespace std;

using i64 = int64_t;

#define rep(i, x, y) for (i64 i = i64(x), i##_max_for_repmacro = i64(y); i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif

template <i64 p>
class fp {
    public:
    i64 x;
    fp() : x(0) {}
    fp(i64 x_) : x((x_ % p + p) % p) {}
    fp operator+() const { return fp(x); }
    fp operator-() const { return fp(-x); }
    fp& operator+=(const fp& y) {
        x += y.x;
        if (x >= p) x -= p;
        return *this;
    }
    fp& operator-=(const fp& y) { return *this += -y; }
    fp& operator*=(const fp& y) {
        x = x * y.x % p;
        return *this;
    }
    fp& operator/=(const fp& y) { return *this *= fp(inverse(y.x)); }
    fp operator+(const fp& y) const { return fp(x) += y; }
    fp operator-(const fp& y) const { return fp(x) -= y; }
    fp operator*(const fp& y) const { return fp(x) *= y; }
    fp operator/(const fp& y) const { return fp(x) /= y; }
    bool operator==(const fp& y) const { return x == y.x; }
    bool operator!=(const fp& y) const { return !(*this == y); }
    i64 extgcd(i64 a, i64 b, i64& x, i64& y) {
        i64 d = a;
        if (b != 0) {
            d = extgcd(b, a % b, y, x);
            y -= (a / b) * x;
        } else {
            x = 1;
            y = 0;
        }
        return d;
    }
    i64 inverse(i64 a) {
        i64 x, y;
        extgcd(a, p, x, y);
        return (x % p + p) % p;
    }
};

template <i64 p>
i64 abs(const fp<p>& x) { return x.x; }

template <i64 p>
istream& operator>>(istream& is, fp<p>& x) {
    is >> x.x;
    return is;
}

template <i64 p>
ostream& operator<<(ostream& os, const fp<p>& x) {
    os << x.x;
    return os;
}

template <typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
    os << "[";
    for (const auto& v : vec) {
        os << v << ",";
    }
    os << "]";
    return os;
}

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

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

template <typename A, typename T, size_t size>
void fill(A (&ary)[size], const T& val) {
    fill((T*)ary, (T*)(ary + size), val);
}

constexpr int inf = 1.01e9;
constexpr i64 inf64 = 4.01e18;
constexpr long double eps = 1e-9;

// double(64bit浮動小数)のn分探索のループ回数の上限(2分探索なら50でも十分かもしれない). long double(80ビットの x87 浮動小数点型?)だと, 2分探索であってもこれだと足りないケースがある気がするので, もうちょっと余裕を持たせた方が良さそう.
constexpr i64 max_loop = 100;

struct doubling_table{
    const i64 n; // 要素数
    vector<vector<i64>> table; // table[k][i] = i番目の要素の「2^k個次の要素」
    i64 end_point;

    doubling_table(const vector<i64>& next, const i64& end_point): n(next.size()), end_point(end_point){
        init_table(next);
    }

    // i番目の要素のq個次の要素を求める.
    i64 next_q(i64 i, i64 q){
        i64 res=i;
        rep(k,0,table.size()){
            if(q&(1l<<k)) res=table[k][res];
            if(res==end_point) return end_point;
        }
        return res;
    }

private:
    void init_table(const vector<i64>& next){
        // 2^exp>=n を満たす最小のexpを求める.
        i64 pow2=1,exp=0;
        while(pow2<=n){
            pow2*=2;
            ++exp;
        }

        table = vector<vector<i64>>(exp + 1, vector<i64>(n, end_point));

        rep(i,0,n) table[0][i]=next[i];

        rep(k, 0, exp){
            rep(i,0,n){
                if(table[k][i]==end_point){
                    table[k+1][i]=end_point;
                }else{
                    table[k+1][i]=table[k][table[k][i]];
                }
            }
        }
    }
};

void solve() {
    //constexpr i64 mod = 1'000'000'007;
    i64 N;
    cin >> N;
    vector<i64> x(N);
    rep(i,0,N) cin >> x[i];
    i64 L,Q;
    cin >> L >> Q;
    vector<i64> a(Q),b(Q);
    rep(i,0,Q){
        cin >> a[i] >> b[i];
        --a[i];
        --b[i];
        if(a[i]>b[i]) swap(a[i],b[i]);
    }

    vector<i64> next(N);
    rep(i,0,N){
        auto over=upper_bound(begin(x),end(x),L+x[i]);
        next[i]=over-begin(x)-1;
    }

    doubling_table dt(next,N-1);

    rep(i,0,Q){
        i64 lb=0,ub=N-1;
        while(ub-lb>1){
            i64 md=(lb+ub)/2;
            if(dt.next_q(a[i],md)<b[i]) lb=md;
            else ub=md;
        }

        cout << ub << endl;
    }
}

int main() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(false);
    cout.setf(ios::fixed);
    cout.precision(16);
    solve();
    return 0;
}


Measured memory_bytes: 19568