#include <bits/stdc++.h>
using namespace std;
// type
typedef long long ll;
typedef long double ld;
// loop
//#define For(i, l, r, x)     for (int i = l; i < r; i+=x)
//#define ForE(i, l, r, x)    for (int i = l; i <= r; i+=x)
//#define Ford(i, r, l)       for (int i = r; i > l; i--)
//#define FordE(i, r, l)      for (int i = r; i >= l; i--)
//#define Fora(i, a)          for (auto i : a)
// I/O 
#define FAST_IO             std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
//#define PrintV(a)           Fora(ii, a) cout << ii << ' '; cout << rl;
//#define PrintVl(a)          Fora(ii, a) cout << ii << rl;
//#define PrintA(a, l, r)     for (int ii = l; ii <= r; ii++) cout << a[ii] << ' '; cout << rl;
//#define PrintAl(a, l, r)    for (int ii = l; ii <= r; ii++) cout << a[ii] << rl;
//#define Ptest(x)            return cout << x, 0;
#define setpre(n)           fixed << setprecision(n)
// pair
#define F                   first
#define S                   second
#define pii                 pair<int, int>
#define pll                 pair<ll, ll>
#define pdd                 pair<ld, ld>
// vector & !!?(string)
#define eb                  emplace_back
#define pb                  push_back
#define all(a)              a.begin(), a.end()
#define rall(a)             a.rbegin(), a.rend()
#define sz(a)               a.size()
#define len(a)              a.length()
// geometry calc    
#define pi                  acos(-1.0)
#define g_sin(a)            sin(a*pi/180)
#define g_cos(a)            cos(a*pi/180)
#define g_tan(a)            tan(a*pi/180)
// set val
#define ms0(a)              memset(a,        0, sizeof(a));
#define ms1(a)              memset(a,        1, sizeof(a));
#define msn1(a)             memset(a,       -1, sizeof(a));
#define msinf(a)            memset(a, 0x3f3f3f, sizeof(a));
// constant
const int mod1 = 998244353, mod = 1e9+7;
const int MAXN = 100005, MAX_M = 200010;
// code
//#define int long long

int x[MAXN];
int sps[MAXN][20];
int n, q, l;
void Solve() {
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> x[i];
    cin >> l >> q;
    int jump = n;
    for (int i = n; i >= 1; i--){
		while(x[jump] - x[i] > l) jump--;
		sps[i][0] = jump;
    }
    for (int d = 1; d <= 19; d++){
        for (int i = 1; i + (1 << d) <= n; i++)
            sps[i][d] = sps[ sps[i][d-1] ][d-1];
    }
    while (q--){
        int a, b, ans = 0;
        cin >> a >> b;
        if (a > b) swap(a, b);
        for (int d = 19; d >= 0; d--){
            if (sps[a][d] < b && sps[a][d]){
                a = sps[a][d];
                ans += (1 << d);
            }
        }
        ans ++;
        cout << ans << endl;
    }
}

signed main(){
    FAST_IO;
    int TC = 1; 
	//cin >> TC;
    while(TC--) Solve();
    return 0;
}

#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;

string S[100];
int main()
{
	int A, B;
	cin >> A >> B;
	for (int i = 0; i < 50; i++) {
		for (int j = 0; j < 100; j++) {
			S[i].push_back('.');
		}
	}
	for (int i = 50; i < 100; i++) {
		for (int j = 0; j < 100; j++) {
			S[i].push_back('#');
		}
	}
	A--; B--;
	int i = 99, j = 2;
	while (A > 0) {
		S[i][j] = '.';
		j += 4;
		if (j >= 100) {
			i--;
			j = i % 2 * 2;
		}
		A--;
	}
	i = 0; j = 0;
	while (B > 0) {
		S[i][j] = '#';
		j += 4;
		if (j >= 100) {
			i++;
			j = i % 2 * 2;
		}
		B--;
	}
	cout << 100 << " " << 100 << endl;
	for (int i = 0; i < 100; i++) {
		cout << S[i] << endl;
	}
}