#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    ll D = (a - c) * (a - c) - 8 * (b - d);
    if(D == 0) {
        cout << "Yes" << endl;
    } else if(D < 0) {
        cout << "No" << endl;
    } else {
        double aa = a, bb = b, cc = c, dd = d;
        double D = (a - c) * (a - c) - 8.0 * (b - d);
        double x1 = ((c - a) + sqrt(D)) / 4.0;
        double x2 = ((c - a) - sqrt(D)) / 4.0;
        double y1 = x1 * x1 + a * x1 + b, y2 = x2 * x2 + a * x2 + b;
        double p = (y2 - y1) / (x2 - x1);
        double q = y1 - x1 * p;
        cout << fixed << setprecision(10) << p << " " << q << endl;
    }
    return 0;
}