#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int) 1e9 + 23111992;
const ll LINF = (ll) 1e18 + 23111992;
const ld PI = acos((ld) -1);
const ld EPS = 1e-9;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ull isqrt(ull k) {ull r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() {return abs((int) mt());}
inline int mrand(int k) {return abs((int) mt()) % k;}
#define db(x) cerr << "[" << #x << ": " << (x) << "] ";
#define endln cerr << "\n";

struct point_t {
    int x, y;
    point_t(int x = 0, int y = 0) : x(x), y(y) {}
    int operator < (const point_t& rhs) const {return make_pair(y, x) < make_pair(rhs.y, rhs.x);}
    int operator == (const point_t& rhs) const {return make_pair(y, x) == make_pair(rhs.y, rhs.x);}
    point_t operator - (const point_t& rhs) const {return point_t(x - rhs.x, y - rhs.y);}
    point_t operator + (const point_t& rhs) const {return point_t(x + rhs.x, y + rhs.y);}
};
long long cross(point_t a, point_t b) {
    return (long long) a.x * b.y - (long long) a.y * b.x;
}
long long area(point_t a, point_t b, point_t c) {
    return cross(a, b) + cross(b, c) + cross(c, a);
}
long long dist(point_t a, point_t b) {
    return (long long) (a.x - b.x) * (a.x - b.x) + (long long) (a.y - b.y) * (a.y - b.y);
}
point_t RotateCCW90(point_t p) {
    return point_t(-p.y, p.x);
}

struct frac_t {
    long long p, q;
    frac_t(long long p = 0, long long q = 1) : p(p), q(q) {}
    friend int operator < (frac_t a, frac_t b) {
        return (__int128) a.p * b.q < (__int128) b.p * a.q;
    }
    void normalize() {
        if (q < 0) {
            p *= -1, q *= -1;
        }
        long long g = __gcd(abs(p), q);
        p /= g, q /= g;
    }
    frac_t operator + (frac_t rhs) {
        frac_t res(p * rhs.q + rhs.p * q, q * rhs.q);
        res.normalize();
        return res;
    }
    frac_t operator - (frac_t rhs) {
        frac_t res(p * rhs.q - rhs.p * q, q * rhs.q);
        res.normalize();
        return res;
    }
    frac_t operator * (frac_t rhs) {
        frac_t res(p * rhs.p, q * rhs.q);
        res.normalize();
        return res;
    }
};

void chemthan() {
    int n; cin >> n;
    int x, y; cin >> x >> y;
    int a, b; cin >> a >> b;
    vector<point_t> recs;
    recs.pb({-a / 2, -b / 2});
    recs.pb({+a / 2, -b / 2});
    recs.pb({+a / 2, +b / 2});
    recs.pb({-a / 2, +b / 2});
    vector<point_t> pts(n);
    FOR(i, 0, n) {
        cin >> pts[i].x >> pts[i].y;
        pts[i].x -= x + a / 2;
        pts[i].y -= y - b / 2;
    }
    for (auto& e : recs) e.x *= 2, e.y *= 2;
    for (auto& e : pts) e.x *= 2, e.y *= 2;
    int res = 0;
    FOR(it, 0, 2) {
        swap(a, b);
        for (auto& e : recs) swap(e.x, e.y);
        for (auto& e : pts) swap(e.x, e.y);
        vector<pair<frac_t, int>> events;
        for (auto p : pts) {
            frac_t lo(-b, 1);
            frac_t hi(+b, 1);
            for (auto q : recs) {
                point_t u = p + q;
                u.x /= 2, u.y /= 2;
                point_t v = u + RotateCCW90(p - q);
                long long tp = cross(u, v);
                long long tq = u.x - v.x;
                //point_t w(0, tp);
                //u.y *= tq, v.y *= tq;
                //assert(!cross(u - w, v - w));
                if (tq < 0) {
                    tp *= -1;
                    tq *= -1;
                }
                long long g = __gcd(abs(tp), abs(tq));
                tp /= g, tq /= g;
                if (q.y < p.y) {
                    chkmin(hi, frac_t(tp, tq));
                }
                else if (p.y < q.y) {
                    chkmax(lo, frac_t(tp, tq));
                }
            }
            if (lo < hi) {
                events.pb({lo, +1});
                events.pb({hi, -1});
            }
        }
        sort(all(events));
        int sum = 0;
        FOR(i, 0, sz(events) - 1) {
            sum += events[i].se;
            if (events[i].fi < events[i + 1].fi) {
                chkmax(res, sum);
            }
        }
    }
    cout << n - res << "\n";
}

int main(int argc, char* argv[]) {
    ios_base::sync_with_stdio(0), cin.tie(0);
    if (argc > 1) {
        assert(freopen(argv[1], "r", stdin));
    }
    if (argc > 2) {
        assert(freopen(argv[2], "wb", stdout));
    }
    chemthan();
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}