#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
//typedef vector<unsigned int>vec;
//typedef vector<ll>vec;
//typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
//template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};


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

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    // int T; cin >> T; REP(t,T) solve();
}