#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

const int DIM = 5002;

int dp[2][DIM];

void solve() {
  int n, x, y;
  cin >> n >> x >> y;

  int mx = 0;
  for (int i = 1, l = 1; i <= n; ++i, l ^= 1) {
    int a, b, c, d;
    cin >> a >> b >> c >> d;

    for (int j = 0; j <= i; ++j) {
      if (dp[1 - l][j] == 0 && j > 0)
        continue;

      int inc_i = j;
      int inc_t = dp[1 - l][j] - inc_i;

      dp[l][j] = max(dp[l][j], dp[1 - l][j]);
      if (a <= x + inc_i && x + inc_i <= b && c <= y + inc_t && y + inc_t <= d) {
        dp[l][j] = max(dp[l][j], dp[1 - l][j] + 1);
        dp[l][j + 1] = max(dp[l][j + 1], dp[1 - l][j] + 1);
        mx = max({mx, dp[l][j], dp[l][j + 1]});
      }
    }
  }

  cout << mx << endl;  
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
//  cin >> t;
  while (t--)
    solve();

  return 0;
}