#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    ll a, b, c, d;
    cin >> a >> b >> c >> d;
    ll D = (a-c)*(a-c)-8*(b-d);
    if(D < 0) puts("No");
    else if(D == 0) puts("Yes");
    else {
        printf("%g %g\n", (a+c)/2.0, (b+d)/2.0);
    }
    return 0;
}