

def 			__UpperCamelCase    (lowerCAmelCase					:  int = 100     )     ->  int:
      A    =				[[0 for _ in range(lowerCAmelCase     )] for _ in range(m + 1     )]
      for i in range(m + 1     ):
            A    =				1

      for n in range(m + 1     ):
            for k in range(1,    lowerCAmelCase     ):
                  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())))






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()))}''')



