#include #define sz(a) int((a).size()) #define pb push_back #define eb emplace_back #define mp make_pair #define mt make_tuple #define F first #define S second #define ld(a) while(a--) #define tci(v,i) for(auto i=v.begin();i!=v.end();i++) #define tcf(v,i) for(auto i : v) #define all(v) v.begin(),v.end() #define rep(i,start,lim) for(long long (i)=(start);i<(lim);i++) #define repd(i,start,lim) for(long long (i)=(start);i>=(lim);i--) #define present(c,x) (find(all(c),x) != (c).end()) #define sync ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define osit ostream_iterator #define INF 0x3f3f3f3f #define LLINF 1000111000111000111LL #define PI 3.14159265358979323 #define endl '\n' #ifdef WIN32 #define getchar_unlocked getchar #endif #define gc getchar #define trace1(x) cerr<<#x<<": "< vi; typedef vector vvi; typedef long long int ll; typedef vector vll; typedef vector vvll; typedef long double ld; typedef pair ii; typedef vector vii; typedef vector vvii; typedef tuple iii; typedef set si; typedef complex pnt; typedef vector vpnt; typedef priority_queue > spq; const ll MOD=1000000007LL; template T sqr(T x){return x*x;} template T gcd(T a,T b){if(a==0) return b; return gcd(b%a,a);} templatevoid read(T &x) { register T c = gc(); x = 0; int t = 0; if (c == '-') t = 1, c = gc(); for (; (c < 48 || c>57); c = gc()); for (; c > 47 && c < 58; c = gc()) { x = (x << 1) + (x << 3) + c - 48; }if (t) x = -x; } template T power(T x,T y,ll m=MOD){T ans=1;while(y>0){if(y&1LL) ans=(ans*x)%m;y>>=1LL;x=(x*x)%m;}return ans%m;} //using this instead of inbuilt pow due to precision issues in that template ll roundp(T x){ll ans=x;if(x-floor(x)<=0.001) ans=floor(x);else if(ceil(x)-x<=0.001) ans=ceil(x);return ans;} int main(){ ll t1,k1,t2,k2; cin>>t1>>k1>>t2>>k2; double a=(double)k1/(double)t1,b=(double)k2/(double)t2; cout<