#include<iostream>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<string.h>
#include<set>
#include<functional>
using namespace std;

#define INF 1<<21
#define MOD 1000000007

int main() {
  int N;
  int W, H;
  int a, b;
  int S, T;
  int table[105][105];
  int maxx;
  while (1) {
	cin >> N;
	if (N == 0) {
	  return 0;
	}
	cin >> W >> H;
	memset(table, 0, sizeof(table));
	maxx = 0;
	for (int i = 0; i < N; i++) {
	  cin >> a >> b;
	  table[b][a] = 1;
	}
	cin >> S >> T;
	for (int i = 1; i <= H - T + 1; i++) {
	  for (int j =1 ; j <= W - S + 1; j++) {
		int cnt = 0;
		for (int k = i; k < i + T; k++) {
		  for (int l = j; l < j + S; l++) {
			if (table[k][l] == 1)cnt++;
		  }
		}
		maxx = max(cnt, maxx);
	  }
	}
	cout << maxx << endl;
  }
}