output_description: Print the probability that a is odd. Your output will be considered correct
  when its absolute or relative error from the judge's output is at most
  10^{-6}.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: A, B = [int(x) for x in input().split()]
  
  
  def bunkai(n):
      sosu = {1}
      tmp = n
      stop_flag = n
  
      if tmp % 2 == 0:
          while tmp % 2 == 0:
              tmp //= 2
          sosu.add(2)
  
      for i in range(3, n + 1, 2):
          if tmp % i == 0:
              while tmp % i == 0:
                  tmp //= i
              sosu.add(i)
              stop_flag = tmp
  
          if i > stop_flag:
              break
      #        else:
      #            stop_flag = int(stop_flag/i)
  
      if tmp != 1:
          sosu.add(tmp)
  
      if sosu == [1]:
          sosu.add(n)
  
      return sosu
  
  
  def check_sosu(n, x):
      ans = 0
      tmp = n
      for i in x:
          if (tmp % i) == 0:
              ans += 1
      return ans
  
  
  ans = check_sosu(B, bunkai(A))
  
  print(ans)
  
problem_description: Statement
  
  Given is an integer N.
  
  Takahashi chooses an integer a from the positive integers not greater than N
  with equal probability.
  
  Find the probability that a is odd.
samples: [{"input": "4", "output": "0.5000000000\n    \n\nThere are four positive integers not greater than 4: 1, 2, 3, and 4. Among\nthem, we have two odd numbers: 1 and 3. Thus, the answer is \\frac{2}{4} = 0.5.\n\n* * *"}, {"input": "5", "output": "0.6000000000\n    \n\n* * *"}, {"input": "1", "output": "1.0000000000"}]