

def 			__UpperCamelCase    (lowerCAmelCase					:  int     )     ->  list:
      A    =				[True for i in range(n + 1     )]
      A    =				[i - 1 for i in range(n + 1     )]
      A    =				[]
      for i in range(2,    n + 1     ):
            if is_prime[i]:
                  primes.append(lowerCAmelCase     )
            for j in range(0,    len(lowerCAmelCase     )     ):
                  if i * primes[j] >= n:
                        break
                  A    =				False

                  if i % primes[j] == 0:
                        A    =				totients[i] * primes[j]
                        break

                  A    =				totients[i] * (primes[j] - 1)

      return totients


if __name__ == "__main__":
   import doctest

   doctest.testmod()






from math import floor, sqrt


def 			__UpperCamelCase    (lowerCAmelCase					:  int     )     ->  int:
      A    =				0.0
      A    =				1.0
      A    =				int(sqrt(lowerCAmelCase     )     )
      A    =				root
      A    =				0
      while integer_part != 2 * root:
            A    =				denominator * integer_part - numerator
            A    =				(n - numerator**2) / denominator
            A    =				int((root + numerator) / denominator     )
            period += 1
      return period


def 			__UpperCamelCase    (lowerCAmelCase					:  int = 10_000     )     ->  int:
      A    =				0
      for i in range(2,    n + 1     ):
            A    =				sqrt(lowerCAmelCase     )
            if sr - floor(lowerCAmelCase     ) != 0 and continuous_fraction_period(lowerCAmelCase     ) % 2 == 1:
                  count_odd_periods += 1
      return count_odd_periods


if __name__ == "__main__":
  print(F'''{solution(int(input().strip()))}''')



