#include #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define all(a) (a).begin(), (a).end() #define bit32(x) (1 << (x)) #define bit64(x) (1ll << (x)) #define sz(v) ((int) v.size()) using namespace std; using i64 = long long; using f80 = long double; using vi32 = vector; using vi64 = vector; using vf80 = vector; using vstr = vector; void yes() { cout << "Yes" << endl; exit(0); } void no() { cout << "No" << endl; exit(0); } template class pqasc : public priority_queue, greater> {}; template class pqdesc : public priority_queue, less> {}; template void amax(T &x, T y) { x = max(x, y); } template void amin(T &x, T y) { x = min(x, y); } template T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template istream& operator>>(istream &is, vector &v) { for (auto &x : v) is >> x; return is; } template ostream& operator<<(ostream &os, vector &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } const int INF = 1001001001; const int dx[] = {1, 0, -1, 0}; const int dy[] = {0, 1, 0, -1}; void solve() { i64 a, b, c, d; cin >> a >> b >> c >> d; i64 x = (a - c) * (a - c) - 8 * (b - d); if (x < 0) { cout << "No" << endl; } else if (x == 0) { cout << "Yes" << endl; } else { double x1 = (c - a + sqrt(x)) / 4; double y1 = x1 * x1 + a * x1 + b; double x2 = (c - a - sqrt(x)) / 4; double y2 = -x2 * x2 + c * x2 + d; double a = (y1 - y2) / (x1 - x2); double b = y1 - a * x1; cout << a << " " << b << endl; } }