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

int main() {
  while (true) {
    int n;
    cin >> n;
    if (n == 0) return 0;
    int w, h;
    cin >> w >> h;
    bool a[h + 1][w + 1];
    for (int i = 0; i < h + 1; i++)
      for (int j = 0; j < w + 1; j++)
	a[i][j] = false;

    for (int i = 0; i < n; i++) {
      int x, y;
      cin >> x >> y;
      a[y][x] = true;
    }

    int s, t;
    cin >> s >> t;

    int nmax = 0;
    int count;
    for (int i = 1; i <= h - t + 1; i++) {
      for (int j = 1; j <= w - s + 1; j++) {
	count = 0;
	for (int k = i; k < i + t; k++) {
	  for (int l = j; l < j + s; l++) {
	    if (a[k][l] == true) count++;
	  }
	}
	nmax = max(nmax, count);
      }
    }
    cout << nmax << endl;
  }
}