#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
template <class T, class F>
T binarySearch(T ok, T ng, const F &f) {
	while (abs(ok - ng) > 1) {
		T mid = (ok + ng) / 2;
		(f(mid) ? ok : ng) = mid;
	}
	return ok;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	long long a, b, c; cin >> a >> b >> c;
	long double dd = sqrtl(b * b - 4 * a * c);
	long long d = dd;
	if (d * d == b * b - 4 * a * c) {
		long long l = -b - d;
		long long r = -b + d;
		if (a < 0) l *= -1, r *= -1;
		a = abs(a);
		if (l > r) swap(l, r);

		if (r % (2 * a) == 0) r = r / (a * 2) - 1;
		else if (r > 0)r /= 2 * a;
		else r = r / (2 * a) - 1;

		if (l % (2 * a) == 0) l = l / (a * 2) + 1;
		else if (l > 0) l = l / (2 * a) + 1;
		else l = l / (2 * a);
		cout << max(0ll, r - l + 1) << endl;;
	}
	else {
		long double l = (long double)(-b - dd) / (2 * a);
		long double r = (long double)(-b + dd) / (2 * a);
		if (l > r) swap(l, r);
		cout << floor(r) - ceil(l) + 1 << endl;;
	}
	return 0;
}