#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define ld long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
//priority_queue<int,vector<int>, greater<int> > q2;



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	ld a, b, c, d; cin >> a >> b >> c >> d;
	int D = (a - c)*(a - c) - 8 * (b - d);
	if (D == 0) {
		cout << "Yes" << endl;
		return 0;
	}
	if (D < 0) {
		cout << "No" << endl;
		return 0;
	}

	ld x1 = (-(a - c) + pow((a - c)*(a - c) - 8*(b - d), 0.5)) / 4;
	ld x2 = (-(a - c) - pow((a - c)*(a - c) - 8*(b - d), 0.5)) / 4;

	ld y1 = x1 * x1 + a * x1 + b;
	ld y2 = x2 * x2 + a * x2 + b;

	ld p = (y2 - y1) / (x2 - x1);
	ld q = y1 - x1 * p;
	printf("%.15Lf %.15Lf\n", p, q);

	return 0;
}