#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int INF = 2e9;
int main() {
    int n;
    cin >> n;

    vector<int> x(n);
    vector<int> cnt(500, 0);

    for(int i = 0; i < n; i++) {
        cin >> x[i];

        cnt[x[i]]++;
    }

    int m;
    cin >> m;

    vector<int> y(m);
    for(int i = 0; i < m; i++) {
        cin >> y[i];
    }

    sort(y.begin(), y.end());

    int R, K;
    cin >> R >> K;

    int res = 0;
    for(int i = 0; i + K - 1 < m; i++) {
        int A = y[i + K - 1] - R;
        int B = y[i] + R;

        int tmp = 0;
        for(int j = A; j <= B; j++) {
            tmp += cnt[j];
        }

        res = max(res, tmp);

    }

    cout << res << endl;

    return 0;
}