#include <bits/stdc++.h>

using namespace std;

int dp[5010][5010];
int min_x[5010], max_x[5010], min_y[5010], max_y[5010];

bool ok(int x, int y, int min_x, int max_x, int min_y, int max_y) {
  return min_x <= x && x <= max_x && min_y <= y && y <= max_y;
}

int main() {
  int n, x, y;
  scanf("%d%d%d", &n, &x, &y);
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      dp[i][j] = -1e9;
    }
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d%d%d%d", &min_x[i], &max_x[i], &min_y[i], &max_y[i]);
  }
  if (ok(x, y, min_x[1], max_x[1], min_y[1], max_y[1])) {
    dp[1][0] = 1;
    dp[1][1] = 1;
  } else {
    dp[1][0] = 0;
    dp[1][1] = 0;
  }
  for (int i = 1; i < n; i++) {
    for (int j = 0; j <= i; j++) {
      // printf("dp[%d][%d] = %d\n", i, j, dp[i][j]);
      int now_x = x + j;
      int now_y = y + i - j;
      if (ok(now_x, now_y, min_x[i + 1], max_x[i + 1], min_y[i + 1],
             max_y[i + 1])) {
        // printf("%d,%d --> %d, %d\n", i, j, i + 1, j);
        dp[i + 1][j] = max(dp[i + 1][j], dp[i][j] + 1);
        dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + 1);
      } else {
        dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
        dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j]);
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= n; i++) {
    ans = max(ans, dp[n][i]);
  }
  printf("%d\n", ans);
}