#include <stdio.h>

int main()
{
  int field[128][128];
  int N, W, H, S, T, i, j, x, y, maxTree, numTree;
  while (1) {
    scanf("%d", &N); if (N == 0) { break; }
    for (i = 0; i < 128; i++) {
      for (j = 0; j < 128; j++) {
        field[i][j] = 0;
      }
    }
    scanf("%d%d", &W, &H);
    for (i = 0; i < N; i++) {
      scanf("%d%d", &x, &y);
      field[x][y] = 1;
    }
    scanf("%d%d", &S, &T);

    maxTree = 0;
    for (x = 1; x <= W-S+1; x++) {
      for (y = 1; y <= H-T+1; y++) {
        numTree = 0;
        for (i = 0; i < S; i++) {
          for (j = 0; j < T; j++) {
            if (field[x+i][y+j] == 1) {
              numTree++;
            }
          }
        }
        if (maxTree < numTree) { maxTree = numTree; }
      }
    }
    printf("%d\n", maxTree);
  }
  return 0;
}