let modulo = 1000000007
let (+) a b = (a + b) mod modulo
let ( * ) a b = (a * b) mod modulo
let rec ( ** ) a n =
  if n = 0 then 1
  else if n mod 2 = 1 then a * a ** (n-1)
  else let h = a ** (n/2) in h * h
let inv x = x ** (modulo-2)
let (/) a b = a * inv b

let comb =
  let fact = Array.make 200001 1 in
  let facti = Array.make 200001 1 in
  for i = 1 to 200000 do
    fact.(i) <- i * fact.(i-1);
    facti.(i) <- inv fact.(i)
  done;
  fun n k -> fact.(n) * facti.(k) * facti.(n-k)

let () =
  Scanf.scanf "%d %d %d %d" @@ fun n a b c ->
  let a, b, c = a / (a+b), b / (a+b), c / (100-c) in
  Array.init n (fun i ->
    ((a**n * b**i + a**i * b**n) * comb (n+i-1) (n-1)) * (c+1) * (n+i))
  |> Array.fold_left (+) 0
  |> Printf.printf "%d\n"

