#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main(int argc, char const *argv[]) {
  //2x^2 + (a-c)x + b-d = 0
  // (a-c)^2 - 4*2*(b-d) == 0
  ll a, b, c, d;std::cin >> a >> b >> c >> d;
  ll D = (a-c)*(a-c) - 8*(b-d);
  if(D==0) std::cout << "Yes" << '\n';
  else if(D<0) std::cout << "No" << '\n';
  else{
    ld x = a-c;
    ld y = b-d;
    x /= 2;
    y /= 2;
    ld l = (-x-sqrt(x*x-4*y))/2.0;
    ld r = (-x+sqrt(x*x-4*y))/2.0;
    ld fl = l*l+(ld)a*l+(ld)b;
    ld fr = r*r+(ld)a*r+(ld)b;
    ld p = (fr-fl)/(r-l);
    ld q = fl - l*p;
    std::cout << fixed << setprecision(20) << p << " " << q  << '\n';
  }
  return 0;
}