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

#define rep(i,a,b) for (int i = a; i < b; ++i)
#define sz(s) ((int)(s).size())

typedef long double ld;

template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct Point {
	typedef Point P;
	T x, y;
	explicit Point(T x=0, T y=0) : x(x), y(y) {}
	bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
	bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
	P operator+(P p) const { return P(x+p.x, y+p.y); }
	P operator-(P p) const { return P(x-p.x, y-p.y); }
	P operator*(T d) const { return P(x*d, y*d); }
	P operator/(T d) const { return P(x/d, y/d); }
	T dot(P p) const { return x*p.x + y*p.y; }
	T cross(P p) const { return x*p.y - y*p.x; }
	T cross(P a, P b) const { return (a-*this).cross(b-*this); }
	T dist2() const { return x*x + y*y; }
	double dist() const { return sqrt((double)dist2()); }
	// angle to x-axis in interval [-pi, pi]
	double angle() const { return atan2(y, x); }
	P unit() const { return *this/dist(); } // makes dist()=1
	P perp() const { return P(-y, x); } // rotates +90 degrees
	P normal() const { return perp().unit(); }
	// returns point rotated 'a' radians ccw around the origin
	P rotate(double a) const {
		return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
	friend ostream& operator<<(ostream& os, P p) {
		return os << "(" << p.x << "," << p.y << ")"; }
};

typedef Point<double> P;
#define arg(p, q) atan2(p.cross(q), p.dot(q))
double circlePoly(P c, double r, vector<P> ps) {
    // cerr << "enter" << endl;
	auto tri = [&](P p, P q) {
		auto r2 = r * r / 2;
		P d = q - p;
		auto a = d.dot(p)/d.dist2(), b = (p.dist2()-r*r)/d.dist2();
		auto det = a * a - b;
		if (det <= 0) return arg(p, q) * r2;
		auto s = max(0., -a-sqrt(det)), t = min(1., -a+sqrt(det));
		if (t < 0 || 1 <= s) return arg(p, q) * r2;
		P u = p + d * s, v = p + d * t;
		return arg(p,u) * r2 + u.cross(v)/2 + arg(v,q) * r2;
	};
	auto sum = 0.0;
	rep(i,0,sz(ps))
		sum += tri(ps[i] - c, ps[(i + 1) % sz(ps)] - c);
	return sum;
}

ld eps = 1e-6;

int main() {
    ld r, dx, dy, x, y, p; cin >> r >> dx >> dy >> x >> y >> p;
    P c{x, y};
    while (c.x > -r) c.x -= dx;
    while (c.y < r) c.y += dy;


    ld big = 0.0, small = 1e9;

    vector<ld> pcs;

    ld tx = c.x;
    bool skip = 0;
    while (c.y > -r) {
        while (c.x < r) {
            if (skip && c.x*c.x + c.y*c.y < r*r - dx*dx - dy*dy) {c.x += dx; continue;}
            vector<P> poly;
            poly.push_back(P{c.x+dx, c.y});
            poly.push_back(P{c.x, c.y});
            poly.push_back(P{c.x, c.y-dy});
            poly.push_back(P{c.x+dx, c.y-dy});

            ld area = circlePoly(P{0, 0}, r, poly);
            // cerr << area << endl;

            c.x += dx;
            if (area < eps) continue;
            big = max(big, area);
            pcs.push_back(area);

            // cerr << c.x << endl;
        }

        c.y -= dy;
        c.x = tx;
        skip = 1;
            // cerr << "test" << endl;

    }

    // cerr << big << endl;

    int ans = 0;
    for (auto x : pcs) {
        // cerr << x << endl;
        if (x/big-p < eps) ans++;
    }
    cout << ans << "\n";
}