#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll INF = (ll)1e18;
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1LL, 0LL, -1LL, 0LL};
constexpr ll dy[4] = {0LL, 1LL, 0LL, -1LL};
constexpr ll dx8[8] = {1LL, 0LL, -1LL, 0LL, 1LL, 1LL, -1LL, -1LL};
constexpr ll dy8[8] = {0LL, 1LL, 0LL, -1LL, 1LL, -1LL, 1LL, -1LL};
void p() { std::cout << '\n'; }
template <typename Head, typename... Tail>
void p(Head head, Tail... tail) {
  std::cout << head << (sizeof...(tail) ? " " : "");
  p(tail...);
}
template <typename T>
inline void pv(std::vector<T>& v) {
  for (ll i = 0, N = v.size(); i < N; i++)
    std::cout << v[i] << " \n"[i == N - 1];
}
template <typename T>
inline T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <typename T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <typename T>
inline bool chmax(T& a, T b) {
  return a < b && (a = b, true);
}
template <typename T>
inline bool chmin(T& a, T b) {
  return a > b && (a = b, true);
}
template <typename T>
inline void uniq(std::vector<T>& v) {
  v.erase(unique(v.begin(), v.end()), v.end());
}
void solve() {
  ll N;
  cin >> N;
  vector<ll> x(N, 0);
  for (ll i = 0, i_length = (N); i < i_length; ++i) cin >> x[i];
  ll L, Q;
  cin >> L >> Q;
  vector<ll> rui(N + 1, 0);
  for (ll i = 0, i_length = (N); i < i_length; ++i) {
    rui[i + 1] = rui[i] + x[i];
  }
  vector<ll> ans(Q, 0);
  for (ll q = 0, q_length = (Q); q < q_length; ++q) {
    ll a, b;
    cin >> a >> b;
    a--;
    b--;
    if (a > b) swap(a, b);
    ll count = 1;
    ll t = 0;
    for (ll i = a + 1; i <= b; i++) {
      if (t + x[i] - x[i - 1] <= L) {
        t += x[i] - x[i - 1];
      } else {
        count++;
        t = x[i] - x[i - 1];
      }
    }
    ans[q] = count;
  }
  for (ll q = 0, q_length = (Q); q < q_length; ++q) p(ans[q]);
}
signed main() {
  solve();
  return 0;
}
