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: #################################
  # ここからcode
  import fractions
  
  A, B = map(int, input().split())
  
  gcd = fractions.gcd(A, B)
  if gcd == 1:
      print(1)
  else:
  
      def factorization(n):
          arr = []
          temp = n
          for i in range(2, int(-(-(n**0.5) // 1)) + 1):
              if temp % i == 0:
                  cnt = 0
                  while temp % i == 0:
                      cnt += 1
                      temp //= i
                  arr.append([i, cnt])
  
          if temp != 1:
              arr.append([temp, 1])
  
          if arr == []:
              arr.append([n, 1])
  
          return arr
  
      soinsulist = factorization(gcd)
      print(len(soinsulist) + 1)
  
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"}]