#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

const long double eps = 1e-10;

long double fc(long double n, long double a, long double b, long double c, long double d){
  long double ret = -2*n*n + (c - a)*n + (d-b);
  return ret;
}

int main(){
  int ia, ib, ic, id;
  long double  a, b, c, d;
  cin >> ia >> ib >> ic >> id;
  if(id - ib < 0){
    cout << "No" << endl;
    return 0;
  }else if(id - ib == 0){
    cout << "Yes" << endl;
    return 0;
  }
  a = ia; b = ib; c = ic; d = id;
  // long double r = (c-a) * (c-a) + 8*(d-b);
  // long double sq = mysqrtl(r);
  // long double xa = ((c - a) + sq)/4;
  // long double xb = ((c - a) - sq)/4;
  // long double ya = xa*xa + a*xa + b;
  // long double yb = xb*xb + a*xb + b;
  // long double p = (yb-ya)/(xb-xa);
  // long double q = -p * xa + ya;
  long double m = (c-a)/4;
  // cerr << m << endl;
  long double lim = -1e30, l = m;
  while(l-lim > eps){
    long double mid = (l+lim)/2;
    long double fa = fc(mid, a, b, c, d);
    if(fa < 0) lim = mid;
    else l = mid;
  }
  lim = 1e30;
  long double r = m;
  while(lim-r > eps){
    long double mid = (r+lim)/2;
    long double fa = fc(mid, a, b, c, d);
    if(fa >= 0) r = mid;
    else lim = mid;
  }
  // cout << fixed << setprecision(15) << l<< " " << r << endl;
  long double ya = l*l + a*l + b;
  long double yb = r*r + a*r + b;
  long double p = (yb-ya)/(r-l);
  long double q = -p * l + ya;
  cout << fixed << setprecision(15) << p << " " << q << endl;
  return 0;
}