SmallR is an archer. SmallR is taking a match of archer with Zanoes. They try to shoot in the target in turns, and SmallR shoots first. The probability of shooting the target each time is <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/a7487d7e62f90136b78ae3fbf0a008396f146e13.png" style="max-width: 100.0%;max-height: 100.0%;"/> for SmallR while <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/c443c7703e51f03d0eece0b96b9e84e425878209.png" style="max-width: 100.0%;max-height: 100.0%;"/> for Zanoes. The one who shoots in the target first should be the winner.

Output the probability that SmallR will win the match.
A single line contains four integers <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/488158367221f441ba94b9475c03436069df2a7e.png" style="max-width: 100.0%;max-height: 100.0%;"/>.

from collections import Counter,defaultdict,deque
#from heapq import *
#from itertools import *
#from operator import itemgetter
#from itertools import count, islice
#from functools import reduce
#alph = 'abcdefghijklmnopqrstuvwxyz'
#dirs = [[1,0],[0,1],[-1,0],[0,-1]]
#from math import factorial as fact
#a,b = [int(x) for x in input().split()]
#sarr = [x for x in input().strip().split()]
#import math
#from math import *

import sys
input=sys.stdin.readline
#sys.setrecursionlimit(2**30)
#MOD = 10**9+7
def solve():
    a,b,c,d = [int(x) for x in input().split()]
    p1 = a/b
    p2 = c/d
    p = p1/(1-(1-p1)*(1-p2))
    print(p)

tt = 1#int(input())
for test in range(tt):
    solve()

 


 
 
 
 
 
 
 
 
 
 
 
 
#
