#include #define rep(i,n) for (int i = 0; i < (n); i ++) using namespace std; typedef long long ll; typedef pair PL; typedef pair P; const int INF = 1e9; const ll MOD = 1e9 + 7; int main() { ll A,B,C,d; cin >> A >> B >> C >> d; ll D = (C - A)*(C - A) - 8*(B - d); if (D > 0) {cout << (double)(A + C)/2 << ' ' << (double)(B + d)/2 << endl;} else if (D == 0) {cout << "Yes" << endl;} else cout << "No" << endl; }