#include <bits/stdc++.h>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

ll gcd(ll n, ll m)
{
	ll tmp;
	while (m != 0)
	{
		tmp = n % m;
		n = m;
		m = tmp;
	}
	return n;
}

ll lcm(ll n, ll m)
{
	return abs(n) / gcd(n, m) * abs(m); //gl=xy
}

using namespace std;

void solve()
{
	double a, b, c, d;
	cin >> a >> b >> c >> d;
	double D = (a - c) * (a - c) - 8.0 * (b - d);
	if(D<0){
		cout << "No\n";
	}
	else if(D==0){
		cout << "Yes\n";
	}
	else{
		double x1 = (-(a - c) + sqrt(D)) / 4.0;
		double x2 = (-(a - c) - sqrt(D)) / 4.0;
		double y1 = x1 * x1 + a * x1 + b;
		double y2 = -x2 * x2 + c * x2 + d;
		double p = (y2 - y1) / (x2 - x1);
		double q = y1 - p * x1;
		cout << p << " " << q << endl;
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}