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

int main() {
  int n;
  while(cin >> n, n) {
    int w, h; cin >> w >> h;
    bool field[110][110];
    //memset(field, false, sizeof(field));
    for(int i = 0; i < 110; i++) {
      for(int j = 0; j < 110; j++) {
        field[i][j] = false;
      }
    }

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

    int s, t; cin >> s >> t;
    int ans = 0;
    for(int i = 1; i < h-t+10; i++) {
      for(int j = 1; j < w-s+10; j++) {
        int sum = 0;
        for(int k = 0; k < t; k++) {
          for(int l = 0; l < s; l++) {
            if(field[i+k][j+l]) sum++;
          }
        }
        if(sum > ans) ans = sum;
      }
    }
    cout << ans << endl;
  }
}