/* Sample solution to Euclidean TSP from NWERC'14.
 *
 * Algorithm: objective is convex -- ternary search
 *
 * Author: Per Austrin
 */
#include <cstdio>
#include <cmath>

long double n, p, s, v;

long double tottime(long double c) {
	return n*pow(log2(n), c*sqrt(2.0))/(p*1e9) + s*(1+1/c)/v;
}

int main(void) {
	scanf("%Lf%Lf%Lf%Lf", &n, &p, &s, &v);
	long double lo = 0, hi = 1;
	while (tottime(hi) < tottime(hi/2)) hi *= 2;
	for (int i = 0; i < 1000; ++i) {
		long double c1 = (2*lo+hi)/3, c2 = (lo+2*hi)/3;
		if (tottime(c1) > tottime(c2)) lo = c1;
		else hi = c2;
	}
	printf("%.9Lf %.9Lf", tottime(lo), lo);
	return 0;
}