#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define MOD (long long)(1e9+7)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)

ll gcd(ll a, ll b)
{
  if(b == 0) return a;
  return gcd(b, a % b);
}

// mod m におけるa の逆元
// 
ll modinv(ll a, ll m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}


void solve()
{
  // ll n; cin >> n;
  ll a, b, c, d; cin >> a >> b >> c >> d;
  // string s; cin >> s;
  // vector<ll> a(n); REP(i, n) cin >> a[i];
  // ll ans = 0;
  // bool ok = false;
  ll D = (a - c) * (a - c) - 8 * ( b - d);
  if(D < 0) {
    cout << "No" << endl;
    return;
  }
  if(D == 0) {
    cout << "Yes" << endl;
    return ;
  }
  double p = (double)(a + c) / 2.0;
  double q = (double)(b + d) / 2.0;
  printf("%.10f %.10f\n", p, q);
  // cout << ans << endl;
  // cout << (ok?"Yes":"No") << endl;
}


int main(void)
{
  // ll t; cin >> t; REP(i, t)
  solve();
}