#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <numeric>
#include <random>
#include <algorithm>
#include <functional>
#include <cassert>

using namespace std;
typedef long long ll;

template<class T> inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template<class T> inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

const int INF = (1 << 30) - 1;
const ll INFLL= (1LL << 61) - 1;
const int MOD = 1000000007;
#define ALL(a) (a).begin(),(a).end()
#define rALL(a) (a).rbegin(),(a).rend()
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)

int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  ll a,b,c,d;
  cin>>a>>b>>c>>d;
  ll D=(a-c)*(a-c)-8*(b-d);
  if(D>0){
    long double lowx=(-a+c-sqrtl(D))/4;
    long double highx=(-a+c+sqrtl(D))/4;
    long double lowy=lowx*lowx+a*lowx+b;
    long double highy=highx*highx+a*highx+b;
    long double p=(highy-lowy)/(highx-lowx);
    long double q=lowy-p*lowx;
    cout<<setprecision(20)<<p<<" "<<q<<endl;
  }else if(D==0){
    cout<<"Yes"<<endl;
  }else{
    cout<<"No"<<endl;
  }
}