output_description: Print the expected number of games that will be played, in the manner
  specified in the statement.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B C
attempt: from fractions import Fraction as F
  
  I = lambda: map(int, input().split())
  mod = 1000000007
  N, A, B, C = I()
  a = F(A, 100)
  b = F(B, 100)
  c = F(C, 100)
  f = N * (a**N) / ((1 - c) ** N) / (1 - c) * ((b**N) / (c**N) - 1) / ((b / c) - 1)
  g = N * (b**N) / ((1 - c) ** N) / (1 - c) * ((a**N) / (c**N) - 1) / ((a / c) - 1)
  print(f + g)
  
problem_description: Statement
  
  Takahashi and Aoki will play a game. They will repeatedly play it until one of
  them have N wins in total.
  
  When they play the game once, Takahashi wins with probability A %, Aoki wins
  with probability B %, and the game ends in a draw (that is, nobody wins) with
  probability C %. Find the expected number of games that will be played, and
  print it as follows.
  
  We can represent the expected value as P/Q with coprime integers P and Q.
  Print the integer R between 0 and 10^9+6 (inclusive) such that R \times Q
  \equiv P\pmod {10^9+7}. (Such an integer R always uniquely exists under the
  constraints of this problem.)
samples: [{"input": "1 25 25 50", "output": "2\n    \n\nSince N=1, they will repeat the game until one of them wins. The expected\nnumber of games played is 2.\n\n* * *"}, {"input": "4 50 50 0", "output": "312500008\n    \n\nC may be 0.\n\n* * *"}, {"input": "1 100 0 0", "output": "1\n    \n\nB may also be 0.\n\n* * *"}, {"input": "100000 31 41 28", "output": "104136146"}]