




from math import floor, sqrt

def 	lowerCAmelCase_	(     lowerCamelCase:				int  )    ->	int:


      '''simple docstring'''




      lowerCamelCase__					     = 0.0
      lowerCamelCase__					     = 1.0
      lowerCamelCase__					     = int(sqrt(lowerCamelCase  )  )
      lowerCamelCase__					     = root
      lowerCamelCase__					     = 0
      while integer_part != 2 * root:
            lowerCamelCase__					     = denominator * integer_part - numerator
            lowerCamelCase__					     = (n - numerator**2) / denominator
            lowerCamelCase__					     = int((root + numerator) / denominator  )
            period += 1
      return period

def 	lowerCAmelCase_	(     lowerCamelCase:				int = 1_00_00  )    ->	int:


      '''simple docstring'''




      lowerCamelCase__					     = 0
      for i in range(2   , n + 1  ):
            lowerCamelCase__					     = 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()))}""")



def       UpperCamelCase__     (  SCREAMING_SNAKE_CASE__ = 100						):
 __lowerCamelCase		:							List[Any]							=						[[0 for _ in range(SCREAMING_SNAKE_CASE__						)] for _ in range(m + 1						)]
 for i in range(m + 1						):
  __lowerCamelCase		:							Any							=						1

 for n in range(m + 1						):
  for k in range(1			,       SCREAMING_SNAKE_CASE__						):
   memo[n][k] += memo[n][k - 1]
   if n > k:
    memo[n][k] += memo[n - k - 1][k]

 return memo[m][m - 1] - 1


if __name__ == "__main__":
       print(solution(int(input('Enter a number: ').strip())))

