#include <bits/stdc++.h>

#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define ALL(v) (v).begin(), (v).end()
#define INF 1e9

using namespace std;
typedef pair<int, int> pii;

int main(){
  int n;
  while(cin >> n and n){
    vector<pii> trees;
    int w, h;
    cin >> w >> h;
    int sum[w][h];
    memset(sum, 0, sizeof(sum));
    int x, y;
    REP(i, n) {
      cin >> x >> y;
      sum[--x][--y] = 1;
    }
    int s, t;
    cin >> s >> t;
    REP(i, w) REP(j, h) {
      if(j == 0) continue;
      sum[i][j] += sum[i][j-1];
    }
    int res = 0;
    REP(i, w-s+1) REP(j, h-t+1){
      int tmp = 0;
      REP(k, s) tmp += sum[i+k][j+t-1] - (j==0 ? 0 : sum[i+k][j-1]);
      res = max(tmp, res);
    }
    cout << res << endl;
  }
  return 0;
}